✦ LIBER ✦

End-transitive graphs

✍ Scribed by Matthias Hamann

Book ID: 113091286
Publisher: The Hebrew University Magnes Press
Year: 2011
Tongue: English
Weight: 251 KB
Volume: 189
Category: Article
ISSN: 0021-2172
DOI: 10.1007/s11856-011-0177-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

6-Transitive graphs

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

Star-transitive graphs

✍ L. L. Velikovich 📂 Article 📅 1980 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 226 KB

Vertex-transitive graphs

✍ Gert Sabidussi 📂 Article 📅 1964 🏛 Springer Vienna 🌐 English ⚖ 642 KB

Semi-transitive graphs

✍ Steve Wilson 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

## Abstract In this paper, we first consider graphs allowing symmetry groups which act transitively on edges but not on darts (directed edges). We see that there are two ways in which this can happen and we introduce the terms __bi‐transitive__ and __semi‐transitive__ to describe them. We examine t

Edge-transitive planar graphs

✍ Branko Grünbaum; G. C. Shephard 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 590 KB

Geodesics in Transitive Graphs

✍ C.Paul Bonnington; Wilfried Imrich; Norbert Seifter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Let P be a double ray in an infinite graph X, and let d and d P denote the distance functions in X and in P respectively. One calls P a geodesic if d(x, y)=d P (x, y), for all vertices x and y in P. We give situations when every edge of a graph belongs to a geodesic or a half-geodesic. Furthermore,