𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Kings in quasi-transitive digraphs

✍ Scribed by J∅rgen Bang-Jensen; Jing Huang

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
505 KB
Volume
185
Category
Article
ISSN
0012-365X

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 transitive digraphs
Distance transitive digraphs
✍ Clement W.H. Lam 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 980 KB

A digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v) = d(x, y) there is an automorphism w of the digraph such that T(U) = x and T(V) = y. Some examples of distance-transitive digraphs are given in Section 2. Section 3 defines the intersection matrix and gives

Kings in semicomplete multipartite digra
Kings in semicomplete multipartite digraphs
✍ Gutin, Gregory; Yeo, Anders 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicomplete p-partite digraph, or just a semicomplete multipartite digraph. A semicomplete multipartite digraph with no cycle of length two is

Kings in locally semicomplete digraphs
Kings in locally semicomplete digraphs
✍ Ruixia Wang; Aimin Yang; Shiying Wang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract A __k__‐king in a digraph __D__ is a vertex which can reach every other vertex by a directed path of length at most __k__. We consider __k__‐kings in locally semicomplete digraphs and mainly prove that all strong locally semicomplete digraphs which are not round decomposable contain a 2

Transitive quasi-uniformities
Transitive quasi-uniformities
✍ P Fletcher; W.F Lindgren 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 461 KB