On the distance connectivity of graphs and digraphs

DOI10.1016/0012-365X(94)90157-0zbMath0796.05058OpenAlexW2051244399MaRDI QIDQ1322268

J. Fàbrega, Miquel Àngel Fiol

Publication date: 15 September 1994

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

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

zbMATH Keywords

inequalitiesdiameterdirected graphgirthedge-connectivitymaximally connecteddirected distancevalencedistance connectivity

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (4)

Connectivity of large bipartite digraphs and graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ On extremal bipartite graphs with high girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient conditions for maximally connected dense graphs
• Large fault-tolerant interconnection networks
• Bipartite graphs and digraphs with maximum connectivity
• On the linegraph of a directed-graph
• Line Digraph Iterations and the (d, k) Digraph Problem
• Maximally connected digraphs

This page was built for publication: On the distance connectivity of graphs and digraphs