On complete strongly connected digraphs with the least number of 3-cycles (Q1923478): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Hamiltonian tournaments with the least number of 3-cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4100106 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Subtournaments of a Tournament / rank | |||
Normal rank | |||
Revision as of 14:42, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On complete strongly connected digraphs with the least number of 3-cycles |
scientific article |
Statements
On complete strongly connected digraphs with the least number of 3-cycles (English)
0 references
6 March 1997
0 references
Consider the class of strongly connected digraphs \(D_n\) with the property that for every pair of distinct nodes \(u\) and \(v\), at least one of the arcs \(uv\) or \(vu\) is in \(D_n\). The authors give a structural characterization of those digraphs in this class that have only \(n-2\) 3-cycles (the smallest possible number).
0 references
3-cycles
0 references
characterization
0 references
digraphs
0 references
