✦ LIBER ✦

On antipodal graphs

✍ Scribed by R. Aravamudhan; B. Rajendran

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 108 KB
Volume: 49
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90117-1

No coin nor oath required. For personal study only.

✦ Synopsis

The antipodal graph of a graph G, denoted by A(G), is the graph on the same vertices as of G, two vertices being adjacent if the distance between them is equal to the diameter of G. A graph is said to be antipodal if it is the antipodal graph A (I4) of some graph H. We give a necessary and sufficient condition for a graph to be an antipodal graph.

The next three statements were easily proved in [1].

📜 SIMILAR VOLUMES

A note on ‘on antipodal graphs’

✍ R Aravamudhan; B Rajendran 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Antipodal graphs and oriented matroids

✍ Komei Fukuda; Keiichi Handa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 786 KB

A graph is antipodal if, for every vertex c', there exists exactly one vertex V which is not closer to r than every vertex adjacent to 6. In this paper we consider the problem of characterizing tope graphs of oriented matroids, which constitute a broad class of antipodal graphs. One of the results i

Cross-cloning and antipodal graphs

✍ Abraham Berman; Anton Kotzig 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 694 KB

Antipodal graphs of diameter three

✍ A. Gardiner 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 290 KB

Merging in Antipodal Distance-Regular Gr

Merging in Antipodal Distance-Regular Graphs

✍ A. Jurisic 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 320 KB

Merging (also called fusion) is studied in antipodal distance-regular graphs. The conditions are determined under which merging the first and the last classes in an antipodal distance-regular graph produces a distance-regular graph. Conversely, given a distance-regular graph with the same intersecti

From regular boundary graphs to antipoda

From regular boundary graphs to antipodal distance-regular graphs

✍ Fiol, M. A.; Garriga, E.; Yebra, J. L. A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB 👁 2 views

Let Γ be a regular graph with n vertices, diameter D, and d + 1 In a previous paper, the authors showed that if P (λ) > n -1, then D ≤ d -1, where P is the polynomial of degree d-1 which takes alternating values ±1 at λ 1 , . . . , λ d . The graphs satisfying P (λ) = n -1, called boundary graphs, h