✦ LIBER ✦

Classification of Regular Planar Graphs with Diameter Two

✍ Scribed by Moo Young Sohn; Sang Bum Kim; Young Soo Kwon; Rong Quan Feng

Book ID: 106277799
Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2005
Tongue: English
Weight: 138 KB
Volume: 23
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-005-0607-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximal planar graphs of diameter two

✍ Karen Seyffarth 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 1020 KB

A maximal planar graph is a simple planar graph in which every face is a triangle. We show here that such graphs with maximum degree A and diameter two have no more than :A + 1 vertices. We also show that there exist maximal planar graphs with diameter two and exactly LiA + 1 J vertices.

Bipartite regular graphs with fixed diam

Bipartite regular graphs with fixed diameter

✍ H. J. Broersma; F. Göbel 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 420 KB

Distance regular graphs of diameter 3 an

Distance regular graphs of diameter 3 and strongly regular graphs

✍ A.E Brouwer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the

Domination in planar graphs with small d

Domination in planar graphs with small diameter

✍ Wayne Goddard; Michael A. Henning 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

## Abstract MacGillivray and Seyffarth (J Graph Theory 22 (1996), 213–229) proved that planar graphs of diameter two have domination number at most three and planar graphs of diameter three have domination number at most ten. They also give examples of planar graphs of diameter four having arbitrar

The diameter of random regular graphs

✍ Béla Bollobás; W. Fernandez de la Vega 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 421 KB

Regular planar graphs with faces of only

Regular planar graphs with faces of only two types and shortness parameters

✍ P. J. Owens 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 931 KB

We construct a small non-Hamiltonian 3-connected trivalent planar graph whose faces are all 4-gons or 7-gons and show that the shortness coefficient of the class of such graphs is less than one. Then, by transforming non-Hamiltonian trivalent graphs into regular graphs of valency four or five, we ob