On the complete digraphs which are simply disconnected

DOI10.5565/PUBLMAT_35291_15MaRDI QIDQ1182645zbMATH OpenOpenAlexFDO

Authors Davide Carlo Demaria, J. Carlos S. Kiihl

Publication date 28 June 1992

Published in Publicacions Matemàtiques (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/41710

zbMATH Keywords

complete digraphshighly regular tournamentsquotient digraphssimply disconnected digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)

Review text

Homotopic methods are employed for the characterization of the complete digraphs which are the composition of non-trivial highly regular tournaments. It is proved that a complete digraph \(D\) is simply disconnected if and only if its simple quotient is a highly regular tournament. A complete digraph \(D_ n\) is simply disconnected if and only if (a) there exists in \(D_ n\) a non-coned 3-cycle; (b) every symmetric pair and every 3-cycle in \(D_ n\) is shrinkable in \(D_ n\).

Recommendations

• scientific article; zbMATH DE number 16382
• Publication:3496354
• scientific article; zbMATH DE number 4035865
• Characterizing homogenous digraphs

Cited in

(7)

• Topology of acyclic complexes of tournaments and coloring
• scientific article; zbMATH DE number 4170934 (Why is no real title available?)
• scientific article; zbMATH DE number 16382 (Why is no real title available?)
• scientific article; zbMATH DE number 177202 (Why is no real title available?)
• Completely Disconnecting the Complete Graph
• Characterizing homogenous digraphs
• Sectionable tournaments: their topology and coloring

This page was built for publication: On the complete digraphs which are simply disconnected

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182645)