𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Number of edges in degree-magic graphs

✍ Scribed by Bezegová, L’udmila; Ivančo, Jaroslav

Book ID
123320584
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
462 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

The maximum number of edges in 2K2-free
The maximum number of edges in 2K2-free graphs of bounded degree
✍ F.R.K. Chung; A. Gyárfás; Z. Tuza; W.T. Trotter 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A graph is 2K,-free if it does not contain an independent pair of edges as an induced subgraph. We show that if G is 2K,-free and has maximum degree A(G) = D, then G has at most 5D2/4 edges if D is even. If D is odd, this bound can be improved to (5D\* -20 + 1)/4. The extremal graphs are unique.

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