𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Superconnected and Hyperconnected Small Degree Transitive Graphs

✍ Scribed by Yingzhi Tian; Jixiang Meng

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
228 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Small vertex-transitive and Cayley graph
Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach
✍ Eyal Loz; Martin Mačaj; Mirka Miller; Jana Šiagiová; Jozef Širáň; Jana Tomanová 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

We examine the existing constructions of the smallest known vertex-transitive graphs of a given degree and girth 6. It turns out that most of these graphs can be described in terms of regular lifts of suitable quotient graphs. A further outcome of our analysis is a precise identification of which of

Large Cayley graphs and vertex-transitiv
Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
✍ Heather Macbeth; Jana Šiagiová; Jozef Širáň; Tomáš Vetrík 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract For any __d__⩾5 and __k__⩾3 we construct a family of Cayley graphs of degree __d__, diameter __k__, and order at least __k__((__d__−3)/3)^__k__^. By comparison with other available results in this area we show that our family gives the largest currently known Cayley graphs for a wide ra

Graphs with constant link and small degr
Graphs with constant link and small degree or order
✍ J. I. Hall 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 957 KB

The graph G has constant link L if for each vertex x of. G the graph induced by G on the, vertices adjacent to x is isomorphic to L. For each graph L on 6 or fewer vertices w e decide whether or not there exists a graph G with constant link L. From this w e are able to list all graphs on 11 or fewer