Yahoo Web Suche

Anmelden

Suchergebnisse

  1. chat4free.netchat4free - dein kostenloser Chat

    chat4free ist 100 % KOSTENLOS. || Chatter gerade aktiv: 2235. Chatte jetzt anonym und kostenlos. Ohne nervige Registrierung.

    • Login

      chat4free ist 100 % KOSTENLOS. || Chatter gerade aktiv:...

  2. www.sciencedirect.com › science › articleEdge-fault diameter of C4-free graphs - ScienceDirect

    1. Jan. 2024 · In this paper we show that the k -edge-fault diameter of a ( k + 1) -edge connected graph of order n not containing a 4-cycle cannot exceed 5 k 2 + k + 1 n + 9, and we construct graphs that show that for k + 1 a prime power this bound is close to optimal if k is large.

  3. link.springer.com › article › 10C 4 -free subgraphs with large average degree - Springer

    25. Nov. 2021 · Motivated by a longstanding conjecture of Thomassen, we study how large the average degree of a graph needs to be to imply that it contains a C4 -free subgraph with average degree at least t. Kühn and Osthus showed that an average degree bound which is double exponential in t is sufficient.

  4. www.sciencedirect.com › science › articleExtremal graphs without 4-cycles - ScienceDirect

    1. Mai 2013 · We define the polarity graph of pi to be e graph with vertex set P , with two distinct vertices x, y adjacent whenever x ∈ φ (y). The graph is lled an orthogonal polarity graph if the polarity is orthogonal. This graph is C 4 -free, has q 2 vertices degree q+ 1, and q+1ofdegreeq, for a total of 1 2 q (q+ 1) 2 edges.

    • Frank A. Firke, Peter M. Kosek, Evan D. Nash, Jason Williford
    • 2013

  5. arxiv.org › abs › 1512[1512.04385] Extremal C4-free/C5-free planar graphs - arXiv.org

    14. Dez. 2015 · Extremal C4-free/C5-free planar graphs. We study the topic of "extremal" planar graphs, defining exP(n, H) to be the maximum number of edges possible in a planar graph on n vertices that does not contain a given graph H as a subgraph.

    • Chris Dowden
    • 2015

  6. www.sciencedirect.com › science › articlePolarity graphs and C4-free multipartite graphs - ScienceDirect

    1. Jan. 2021 · The projective plane Î q in Definition 2.3 admits the orthogonal polarity σ : P∪L → P∪L defined by σ (P) = P and σ ( P) = P for all P ∈ P. Moreover, if q is an odd prime power, the set of the absolute points { (x, y) ∈ Fq × Fq : x2 = 2y} ∪ { (q, q)} generates an oval.

  7. dl.acm.org › doi › 10The Sharp Upper Bounds on the Aα-Spectral Radius of C4-Free...

    1. Feb. 2022 · The largest eigenvalue of Aα (G) A α ( G) is called the Aα A α -spectral radius of G. In this paper, we give sharp upper bounds on the Aα A α -spectral radius of C4 C 4 -free graphs and Halin graphs for α ∈ [1/2, 1) α ∈ [ 1 / 2, 1) respectively.

  1. Verwandte Suchbegriffe zu c4free

    knuddels