𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New largest known graphs of diameter 6

✍ Scribed by Guillermo Pineda-Villavicencio; José Gómez; Mirka Miller; Hebert Pérez-Rosés

Book ID
102958133
Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
779 KB
Volume
53
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal graphs of diameter at most 6 af
Extremal graphs of diameter at most 6 after deleting any vertex
✍ Yoko Usami 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB 👁 1 views

Suppose G is a graph of n vertices and diameter at most d having the property that, after deleting any vertex, the resulting subgraph has diameter at most 6. Then G contains at least max{n. r(4n -8)/31} edges if 4 s d s 6 . ## 1. Introduction We consider finite undirected simple graphs. (Terminolo

Some New Families of Integral Trees with
Some New Families of Integral Trees with Diameters 4 and 6
✍ Ligong Wang; Xueliang Li; Shenggui Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 234 KB

In this paper, some new families of integral trees with diameters 4 and 6 are given. Most of these classes are in nite. They are di erent from those in existing literatures. The discovery of these integral trees is a new contribution to the search of such trees.