𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance Sequences In Locally Infinite Vertex-Transitive Digraphs

✍ Scribed by Wesley Pegden

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
167 KB
Volume
26
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Vertex heaviest paths and cycles in quas
Vertex heaviest paths and cycles in quasi-transitive digraphs
✍ JΓΈrgen Bang-Jensen; Gregory Gutin πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 381 KB

A digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct vertices of D such that (x,y) and (y,z) are arcs of D there is at least one at': from x to z or from z to x. Solving a conjecture by Bangdensen and Huang (1995), Gutin (1995) described polynomial algorithms fo

Distance-Transitivity in Infinite Graphs
Distance-Transitivity in Infinite Graphs
✍ R.G. Moller πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 178 KB

We give a positive answer to a question of Thomassen and Woess; we prove that for an infinite locally finite connected graph with more than one end 2-distancetransitivity implies distance-transitivity. 1994 Academic Press, IΠ»c.