An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph

DOI10.1007/BF02006150zbMath0770.05053OpenAlexW2058572575MaRDI QIDQ1210232

Jun-Ming Xu

Publication date: 25 May 1993

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02006150

zbMATH Keywords

diameterdegreeconnectivitystrongly connected digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Unnamed Item
• On the impossibility of directed Moore graphs
• Connectivity of Regular Directed Graphs with Small Diameters
• A Design for Directed Graphs with Minimum Diameter
• Generalized de Bruijn digraphs

This page was built for publication: An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph