✦ LIBER ✦

A CHARACTERIZATION OF STABLE GRAPHS ON A MAXIMUM(MINIMUM) NUMBER OF EDGES

✍ Scribed by Goddard, W; Winter, P A

Book ID: 118182387
Publisher: Taylor and Francis Group
Year: 1986
Tongue: English
Weight: 144 KB
Volume: 10
Category: Article
ISSN: 1607-3606
DOI: 10.1080/16073606.1986.9631602

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a group testing problem: Characteriza

On a group testing problem: Characterization of graphs with 2-complexity and maximum number of edges

✍ Tatjana Gerzen 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 700 KB

Maximum number of edges in connected gra

Maximum number of edges in connected graphs with a given domination number

✍ Laura A. Sanchis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Sanchis, L.A., Maximum number of edges in connected graphs with a given domination number, Discrete Mathematics 87 (1991) 65-72.

On the maximum number of independent edg

On the maximum number of independent edges in cubic graphs

✍ Arthur M. Hobbs; Edward Schmeichel 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Let the reals be extended to include oo with o~ > r

On the minimum number of edges of two-co

On the minimum number of edges of two-connected graphs with given diameter

✍ A. Jarry; A. Laugier 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Vertex and edge spread of zero forcing n

Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph

✍ Christina J. Edholm; Leslie Hogben; My Huynh; Joshua LaGrange; Darren D. Row 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 907 KB

The maximum number of edges in a graph w

The maximum number of edges in a graph with fixed edge-degree

✍ R.J. Faudree; J. Sheehan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.