✦ LIBER ✦

Some large trivalent graphs having small diameters

✍ Scribed by William M. Kantor

Book ID: 104184289
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 458 KB
Volume: 37-38
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90145-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Region distributions of some small diame

Region distributions of some small diameter graphs

✍ Saul Stahl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 954 KB

Stahl, S., Region distributions of some small diameter graphs, Discrete Mathematics 89 (1991) 281-299. Let G be a graph with a vertex u such that V(G) -{u} induces either a forest or a cycle. It is shown that the region distribution of G is approximately proportional to the Stirling numbers of the f

Some large graphs with given degree and

Some large graphs with given degree and diameter

✍ I. Alegre; M. A. Fiol; J. L. A. Yebra 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB 👁 1 views

This paper considers the (A, 0 ) problem: to maximize the order of graphs with given maximum degree A and diameter 0, of importance for its implications in the design of interconnection networks. Two cubic graphs of diameters 5 and 8 and orders 70 and 286, respectively, and a graph of degree 5, diam

An asymptotic formula for the number of

An asymptotic formula for the number of graphs having small diameter

✍ Ioan Tomescu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 351 KB

In this paper it is shown that for every fixed k 1> 3, G(n; d = k) = 2(~) (6.2 -k + o(1))", where G(n; d = k) denotes the number of graphs of order n and diameter equal to k. It is also proved that for every fixed k>~2, lim,~G(n;d=k)/G(n;d=k+ 1)=lim.o~G(n;d=n-k)/ G(n;d=n-k+ 1)= oo hold.