✦ LIBER ✦

The number of edges of radius-invariant graphs

✍ Scribed by Ondrej Vacek

Book ID: 111493009
Publisher: SP Versita
Year: 2009
Tongue: English
Weight: 385 KB
Volume: 59
Category: Article
ISSN: 0139-9918
DOI: 10.2478/s12175-009-0118-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Radius-edge-invariant and diameter-edge-

Radius-edge-invariant and diameter-edge-invariant graphs

✍ H.B. Walikar; Fred Buckley; M.K. Itagi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 173 KB

On the spectral radius of graphs with cu

On the spectral radius of graphs with cut edges

✍ Huiqing Liu; Mei Lu; Feng Tian 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Bounds on the spectral radius of graphs

Bounds on the spectral radius of graphs with e edges

✍ Shmuel Friedland 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 298 KB

Saturated graphs with minimal number of

Saturated graphs with minimal number of edges

✍ L. Kászonyi; Zs. Tuza 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

Let F = {F,, . . .} be a given class of forbidden graphs. A graph G is called F-saturated if no F, E F is a subgraph of G but the addition of an arbitrary new edge gives a forbidden subgraph. In this paper the minimal number of edges in F-saturated graphs is examined. General estimations are given a

Number of edges in degree-magic graphs

✍ Bezegová, L’udmila; Ivančo, Jaroslav 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 462 KB

On the Number of Edges of Quadrilateral-

On the Number of Edges of Quadrilateral-Free Graphs

✍ Zoltán Füredi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 247 KB

If a graph has q 2 +q+1 vertices (q>13), e edges and no 4-cycles then e 1 2 q(q+1) 2 . Equality holds for graphs obtained from finite projective planes with polarities. This partly answers a question of Erdo s from the 1930's. 1996 Academic Press, Inc. ## 1. Results Let f (n) denote the maximum n