✦ LIBER ✦

Antipodal graphs of diameter three

✍ Scribed by A. Gardiner

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 290 KB
Volume: 46
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(82)90036-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Antipodal distance-regular graphs of dia

Antipodal distance-regular graphs of diameter four and five

✍ Tilla Schade 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB 👁 2 views

An antipodal distance-regular graph of diameter four or five is a covering graph of a connected strongly regular graph. We give existence conditions for these graphs and show for some types of strongly regular graphs that no nontrivial covers exist.

Valency of Distance-regular Antipodal Gr

Valency of Distance-regular Antipodal Graphs with Diameter 4

✍ Štefko Miklavič 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Let G be a non-bipartite strongly regular graph on n vertices of valency k. We prove that if G has a distance-regular antipodal cover of diameter 4, then k ≤ 2(n + 1)/5 , unless G is the complement of triangular graph T (7), the folded Johnson graph J (8, 4) or the folded halved 8-cube. However, for

Nonexistence of some Antipodal Distance-

Nonexistence of some Antipodal Distance-regular Graphs of Diameter Four

✍ Aleksandar Jurišić; Jack Koolen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 160 KB

We find an inequality involving the eigenvalues of a regular graph; equality holds if and only if the graph is strongly regular. We apply this inequality to the first subconstituents of a distance-regular graph and obtain a simple proof of the fundamental bound for distance-regular graphs, discovere

Maximum pebbling number of graphs of dia

Maximum pebbling number of graphs of diameter three

✍ Boris Bukh 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 1 views

## Abstract Given a configuration of pebbles on the vertices of a graph __G__, a __pebbling move__ consists of taking two pebbles off some vertex __v__ and putting one of them back on a vertex adjacent to __v__. A graph is called __pebbleable__ if for each vertex __v__ there is a sequence of pebbli

Antipodal Distance Transitive Covers of

Antipodal Distance Transitive Covers of Complete Graphs

✍ C.D. Godsil; R.A. Liebler; C.E. Praeger 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 352 KB

A distance-transitive antipodal cover of a complete graph K n possesses an automorphism group that acts 2-transitively on the fibres. The classification of finite simple groups implies a classification of finite 2-transitive permutation groups, and this allows us to determine all possibilities for s

Antipodal Distance-transitive Covers of

Antipodal Distance-transitive Covers of Complete Bipartite Graphs

✍ A.A. Ivanov; Robert A. Liebler; Tim Penttila; Cheryl E. Praeger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 480 KB

This paper completes the classification of antipodal distance-transitive covers of the complete bipartite graphs K k , k , where k у 3 . For such a cover the antipodal blocks must have size r р k . Although the case r ϭ k has already been considered , we give a unified treatment of r р k . We use d