On a generalization of transitivity for digraphs

DOI10.1016/0012-365X(88)90175-6MaRDI QIDQ1100476zbMATH OpenOpenAlexFDO

Authors Lael F. Kinch, András Gyárfás, Michael Jacobson

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(88)90175-6

zbMATH Keywords

tournamentstransitive digraphstransitivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Review text

A digraph D is (m-n)-transitive whenever there is a path of length m from x to y there is a subset of \(n+1\) vertices of these \(m+1\) vertices which contain a path of length n from x to y. The authors study properties of these digraphs, in particular (m,1)-transitive digraphs; (m,1)-transitive tournaments are characterized. They give some directions to be pursued.

Recommendations

• Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs
• Digraphs with degree equivalent induced subdigraphs
• scientific article; zbMATH DE number 4156472
• 4-transitive digraphs. I: The structure of strong 4-transitive digraphs
• 3-transitive digraphs

Cites work

• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• Parallel concepts in graph theory

Cited in

(17)

• Reachability relations and the structure of transitive digraphs
• Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs
• Some extremal properties concerning transitivity in graphs
• Construction of a transitive reduction of an acyclic digraph
• Bigraphs and transitions
• k-transitive digraphs and topologies
• The transitive closure of a random digraph
• scientific article; zbMATH DE number 4156471 (Why is no real title available?)
• scientific article; zbMATH DE number 4156472 (Why is no real title available?)
• Transitive index of digraph with \( g\) zero-strong components
• scientific article; zbMATH DE number 1185600 (Why is no real title available?)
• Some remarks on the structure of strong k-transitive digraphs
• Quasi‐transitive digraphs
• Some results on 4-transitive digraphs
• scientific article; zbMATH DE number 5237243 (Why is no real title available?)
• -TRANSITIVE DIGRAPHS PRESERVING A CARTESIAN DECOMPOSITION
• The maximal transitive subtournaments of a digraph: the operator

This page was built for publication: On a generalization of transitivity for digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1100476)