✦ LIBER ✦

The asymptotic number of graphs with a restriction on the maximum degree

✍ Scribed by Brendan D. McKay; Ian M. Wanless; Nicholas C. Wormald

Book ID: 108498133
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 72 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80171-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the independence number of graphs wit

On the independence number of graphs with maximum degree 3

✍ Kanj, Iyad; Zhang, Fenghui 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 1019 KB

The Ramsey number of a graph with bounde

The Ramsey number of a graph with bounded maximum degree

✍ C Chvatál; V Rödl; E Szemerédi; W.T Trotter Jr. 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 269 KB

The asymptotic number of labeled graphs

The asymptotic number of labeled graphs with given degree sequences

✍ Edward A Bender; E.Rodney Canfield 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 470 KB

The maximum number of complete subgraphs

The maximum number of complete subgraphs in a graph with given maximum degree

✍ Cutler, Jonathan; Radcliffe, A.J. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 243 KB

The irredundance number and maximum degr

The irredundance number and maximum degree of a graph

✍ B. Bollobás; E.J. Cockayne 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 104 KB

A vertex x in a subset X of vertices of an undirected graph is redundant if its dosed neighborhood is contained in the union of closed neighborhoods of vertices of X-{x}. In the context of a communications network, this means that any vertex that may receive communications from X may also be irdorme

The independence number in graphs of max

The independence number in graphs of maximum degree three

✍ Jochen Harant; Michael A. Henning; Dieter Rautenbach; Ingo Schiermeyer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 261 KB