๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on diameter and the degree sequence of a graph

โœ Scribed by Simon Mukwembi

Book ID
113449238
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
224 KB
Volume
25
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Note on Large Graphs of Diameter Two a
A Note on Large Graphs of Diameter Two and Given Maximum Degree
โœ Brendan D McKay; Mirka Miller; Jozef ล irรกลˆ ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

Let vt(d, 2) be the largest order of a vertex-transitive graph of degree d and diameter 2. It is known that vt(d, 2)=d 2 +1 for d=1, 2, 3, and 7; for the remaining values of d we have vt(d, 2) d 2 &1. The only known general lower bound on vt(d, 2), valid for all d, seems to be vt(d, 2) w(d+2)ร‚2x W(d

A note on the k-degree Cayley graph
A note on the k-degree Cayley graph
โœ Yuuki Tanaka; Yukio Shibata ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 69 KB
A family of graphs and the degree/diamet
A family of graphs and the degree/diameter problem
โœ Geoffrey Exoo ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 64 KB ๐Ÿ‘ 1 views

## Abstract We investigate a family of graphs relevant to the problem of finding large regular graphs with specified degree and diameter. Our family contains the largest known graphs for degree/diameter pairs (3, 7), (3, 8), (4, 4), (5, 3), (5, 5), (6, 3), (6, 4), (7, 3), (14, 3), and (16, 2). We a

The degree sequence of a random graph. I
The degree sequence of a random graph. I. The models
โœ Brendan D. McKay; Nicholas C. Wormald ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 246 KB ๐Ÿ‘ 2 views

We show that the joint distribution of the degrees of a random graph can be accurately approximated by several simpler models derived from a set of independent binomial distributions. On the one hand, we consider the distribution of degree sequences of 1 random graphs with n vertices and m edges. Fo