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

DOI10.1007/BF02006150MaRDI QIDQ1210232zbMATH OpenOpenAlexFDO

Authors 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

diameterconnectivitydegreestrongly connected digraph

Mathematics Subject Classification ID

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

Recommendations

• The number of \(h\)-strongly connected digraphs with small diameter
• scientific article; zbMATH DE number 2188339
• The connectivity of large digraphs and graphs
• Size of graphs and digraphs with given diameter and connectivity constraints
• Connectivity of Regular Directed Graphs with Small Diameters

Cites work

• scientific article; zbMATH DE number 3455291 (Why is no real title available?)
• A Design for Directed Graphs with Minimum Diameter
• Connectivity of Regular Directed Graphs with Small Diameters
• Generalized de Bruijn digraphs
• On the impossibility of directed Moore graphs

Cited in

(3)

• scientific article; zbMATH DE number 2147943 (Why is no real title available?)
• Lower bounds on the vertex-connectivity of oriented graphs and bipartite oriented graphs
• Maximum size of digraphs with some parameters

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

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