On a generalization of transitivity for digraphs (Q1100476): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585195 / rank | |||
Normal rank | |||
Revision as of 15:34, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a generalization of transitivity for digraphs |
scientific article |
Statements
On a generalization of transitivity for digraphs (English)
0 references
1988
0 references
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.
0 references
transitivity
0 references
transitive digraphs
0 references
tournaments
0 references
