✦ LIBER ✦

On adjacency-transitive graphs

✍ Scribed by Boris Zgrablić

Book ID: 108316178
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 638 KB
Volume: 182
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00155-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On an adjacency property of graphs

✍ Geoffrey Exoo 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 374 KB

## Abstract A graph __G__ has property __A(m, n, k)__ if for any sequence of __m__ + __n__ distinct points of __G__, there are at least __k__ other points, each of which is adjacent to the first __m__ points of the sequence but not adjacent to any of the latter __n__ points. the minimum order among

On making directed graphs transitive

✍ Mathias Weller; Christian Komusiewicz; Rolf Niedermeier; Johannes Uhlmann 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 336 KB

Spectral Analysis for Adjacency Operator

Spectral Analysis for Adjacency Operators on Graphs

✍ Marius Măntoiu; Serge Richard; Rafael Tiedra de Aldecoa 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 323 KB

On the adjacency properties of paley gra

On the adjacency properties of paley graphs

✍ W. Ananchuen; L. Caccetta 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 614 KB

In the application of graph theory to problems arising in network design, the requirements of the network can be expressed in terms of restrictions on the values of certain graph parameters such as connectivity, edge-connectivity, diameter, and independence number. In this paper, we focus on network

6-Transitive graphs

✍ Peter J Cameron 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 929 KB

End-transitive graphs

✍ Matthias Hamann 📂 Article 📅 2011 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 251 KB