𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph diameter, eigenvalues, and minimum-time consensus

✍ Scribed by Hendrickx, Julien M.; Jungers, Raphaël M.; Olshevsky, Alexander; Vankeerberghen, Guillaume

Book ID
121653774
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
541 KB
Volume
50
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum graphs of specified diameter, co
Minimum graphs of specified diameter, connectivity and valence. II
✍ E. Engelhardt; V. Klee; K. Li; H. Quaife 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 769 KB

In order to avoid trivialities, it is assumed throughout that d 22, vacal, and ~23. A (d, c, v)-graph is a c-connected graph of diameter d in which each node is of valence v. The minimum order (number of nodes) of such graphs is denoted by p(d, c, v), and a minimum (d, c, v)-graph is one of minimum