𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum size of a planar graph with given degree and even diameter

✍ Scribed by S.A. Tishchenko

Book ID
113582392
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
671 KB
Volume
33
Category
Article
ISSN
0195-6698

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

Extremal graphs of diameter two and give
Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface
✍ Knor, Martin; ?irοΏ½?, Jozef πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 2 views

It is known that for each d there exists a graph of diameter two and maximum degree d which has at least (d/2) (d + 2)/2 vertices. In contrast with this, we prove that for every surface S there is a constant d S such that each graph of diameter two and maximum degree d β‰₯ d S , which is embeddable in