Path-connectivity in local tournaments (Q1356475): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q593214 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Michael Hager / rank | |||
Normal rank |
Revision as of 19:49, 19 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Path-connectivity in local tournaments |
scientific article |
Statements
Path-connectivity in local tournaments (English)
0 references
5 January 1998
0 references
A digraph \(D\) is called generalized arc-pancyclic if \(D\) is arc-pancyclic and for any two nonadjacent vertices \(x,y\in V(D)\) there are an \((x,y)\)-path of length \(k\) and a \((y,x)\)-path of length \(k\) for each \(k\in\{2,3,\dots,|V(D)|-1\}\). A digraph is strongly path-panconnected if for any two vertices \(x,y\in V(D)\) and any integer \(k\) with \(2\leq k\leq |V(D)|-1\), there is an \((x,y)\)-path of length \(k\) and a \((y,x)\)-path of length \(k\) in \(D\). The author characterizes generalized arc-pancyclic and strongly path-panconnected local tournaments, respectively, by defining classes of digraphs hindering this characteristic. These are extensions of corresponding results for tournaments of \textit{F. Tian}, \textit{Z.-S. Wu} and \textit{C.-Q. Zhang} [J. Comb. Theory, Ser. B 33, 245-255 (1982; Zbl 0495.05028)] and \textit{K.-M. Zhang} [J. Comb. Theory, Ser. B 33, 166-177 (1982; Zbl 0488.05038)], respectively.
0 references
digraph
0 references
tournament
0 references