On complete strongly connected digraphs with the least number of 3-cycles
type: Item
instance of: scholarly article
title: On complete strongly connected digraphs with the least number of 3-cycles
zbMATH Open document ID: 0857.05041
DOI: 10.1016/0012-365X(94)00366-Q
author: Jan Pelant
author: Marco Burzio
published in: Discrete Mathematics
publication date: 1997-03-06T00:00:00Z
review text: 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).
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 932522
zbMATH Keywords: 3-cycles
zbMATH Keywords: characterization
zbMATH Keywords: digraphs
reviewed by: J. W. Moon
MaRDI profile type: Publication
cites work: Hamiltonian tournaments with the least number of 3-cycles
cites work: Q4100106
cites work: On Subtournaments of a Tournament
full work available at URL: 0012-365x(94)00366-q
OpenAlex ID: W2060132236
description: scientific article; zbMATH DE number 932522