Autonomous parts and decomposition of regular tournaments (Q686435): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Near-homogeneous tournaments and permutation groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4729814 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5615282 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5530476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5588447 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585195 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On strongly homogeneous tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3872493 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Doubly regular tournaments are equivalent to skew Hadamard matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Caracterisation Des Tournois Presqu'Homogenes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3691703 / rank | |||
Normal rank |
Revision as of 11:09, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Autonomous parts and decomposition of regular tournaments |
scientific article |
Statements
Autonomous parts and decomposition of regular tournaments (English)
0 references
5 April 1994
0 references
The weight of an arc in a tournament is the number of 3-cycles containing the arc. Two vertices \(x\) and \(y\) of a regular tournament are \(W\)- equivalent if the arcs directed towards (away from) \(x\) have the same weights as the arcs directed towards (away from) \(y\), respectively. The authors' main aim is to obtain some results on arc-weights for regular tournaments with a non-trivial subset \(S\) of vertices such that for every vertex \(y\) not in \(S\) either \(y\) dominates or is dominated by every vertex in \(S\); particular emphasis is given to such tournaments \(S\) all of whose vertices are \(W\)-equivalent.
0 references
3-cycles
0 references
regular tournaments
0 references