On complete strongly connected digraphs with the least number of 3-cycles

DOI10.1016/0012-365X(94)00366-QzbMath0857.05041OpenAlexW2060132236MaRDI QIDQ1923478

Jan Pelant, Marco Burzio

Publication date: 6 March 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00366-q

zbMATH Keywords

characterizationdigraphs3-cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Coevolutionary systems and PageRank

Cites Work

• Hamiltonian tournaments with the least number of 3-cycles
• On Subtournaments of a Tournament
• Unnamed Item

This page was built for publication: On complete strongly connected digraphs with the least number of 3-cycles