𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Non-trivial ΓΔ-regular graphs

✍ Scribed by I. Debroey; F. De Clerck

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
898 KB
Volume
41
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

llsing the results tif C.D. Godsil and B.D. McKay in "Graphs with regular neigh'bourhoods" .t: prove that there are only two non-trivial I'd-regular graphs with diameter 3, and that all the ether non-trivial rA-regular graphs have diameter 2. We also prove that there are no non-trivial rA-regular graphs with q > A + 1. Next we prove that if a (O,l)-geometric graph is a non-trivial rA-regular graph, it is one of the two non-trivial TA-regular graphs with diameter 3. At Past we construct two new non-trivial TA-regular graphs on 28 vertices using the Chang graphs.

📜 SIMILAR VOLUMES

An infinite sequence of ΓΔ-regular graph
An infinite sequence of ΓΔ-regular graphs
✍ T. Kloks 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 494 KB

In this paper we are interested in graphs which, in a sense, are a generalization of strongly regular graphs. We remind the reader that a strongly regular graph with parameters n, k, A, p (notation SRG(n, k, A, p)) is a graph on it vertices, regular of degree k, and such that any two vertices joined

Trivially perfect graphs
Trivially perfect graphs
✍ Martin Charles Golumbic 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 222 KB

An undirected graph i!. rriuially pcrfc~ if for cbzry induced s&graph the stability numbt~r equal; the number of (maximal) cliques. We 1 haracterize the trivialI> perfect graphs a\ a pr0pt.r subclass of the triangulated graphs (thus dis2roving a claim of Buneman 13]1. and we rclart> them to some n :