𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New large graphs with given degree and diameter six

✍ Scribed by G�mez, J.; Pelayo, I.; Balbuena, C.

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
166 KB
Volume
34
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, a method for obtaining large diameter 6 graphs by replacing some vertices of a Moore bipartite diameter 6 graph with complete K h graphs is proposed. These complete graphs are joined to each other and to the remaining nonmodified graphs by means of new edges and by using a special diameter 2 graph. The degree of the graph so constructed coincides with the original one.

📜 SIMILAR VOLUMES

Constructions of large planar networks w
Constructions of large planar networks with given degree and diameter
✍ Fellows, M.; Hell, P.; Seyffarth, K. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 2 views

There is considerable interest in constructing large networks with given diameter and maximum degree. In certain applications, there is a natural restriction for the networks to be planar. Thus, consider the problem of determining the maximum number of nodes in a planar network with maximum degree 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 👁 1 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

Total colorings of planar graphs with la
Total colorings of planar graphs with large maximum degree
✍ Borodin, O. V.; Kostochka, A. V.; Woodall, D. R. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 2 views

It is proved that a planar graph with maximum degree ∆ ≥ 11 has total (vertex-edge) chromatic number ∆ + 1.