𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On making directed graphs transitive

✍ Scribed by Mathias Weller; Christian Komusiewicz; Rolf Niedermeier; Johannes Uhlmann

Book ID
113698471
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
336 KB
Volume
78
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Characterization of (m, 1)-transitive an
Characterization of (m, 1)-transitive and (3,2)-transitive semi-complete directed graphs
✍ Zsolt Tuza πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 875 KB

A directed graph is called (m, k)-transitive if for every directed path x0x1 . ..x. there is a directed path y,y, . ..yt such that x0 =y ,,, x,=yl,, and {yiIO<iik}c{xiIO<i<m}. We describe the structure of those (m, 1)-transitive and (3,2)-transitive directed graphs in which each pair of vertices is

On adjacency-transitive graphs
On adjacency-transitive graphs
✍ Boris ZgrabliΔ‡ πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 638 KB
On edge transitivity of directed graphs
On edge transitivity of directed graphs
✍ Jayme L. Szwarcfiter πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 476 KB

We examine edge transitivity of directed graphs. The class of local comparability graphs is defined as the underlying graphs of locally edge transitive digraphs. The latter generalize edge transitive orientations, while local comparability graphs include comparability, anticomparability, and circle

On Finite 2-Path-Transitive Graphs
On Finite 2-Path-Transitive Graphs
✍ Cai Heng Li; Hua Zhang πŸ“‚ Article πŸ“… 2012 πŸ› John Wiley and Sons 🌐 English βš– 565 KB