On the order and size of \(s\)-geodetic digraphs with given connectivity

DOI10.1016/S0012-365X(96)00314-7zbMath0886.05086OpenAlexW2025274559MaRDI QIDQ1377819

J. Ning

Publication date: 8 April 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00314-7

zbMATH Keywords

connectivityedge-connectivitysuperconnectivity\(s\)-geodetic digraph

Mathematics Subject Classification ID

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

Related Items (20)

Connectivity of graphs with given girth pair ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ On the restricted arc-connectivity of \(s\)-geodetic digraphs ⋮ Lower connectivities of regular graphs with small diameter ⋮ On the connectivity of cages with girth five, six and eight ⋮ On the connectivity of \((k,g)\)-cages of even girth ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ Diameter and connectivity of (D; g)-cages ⋮ On the connectivity and superconnected graphs with small diameter ⋮ New improvements on connectivity of cages ⋮ Unnamed Item ⋮ A new bound for the connectivity of cages ⋮ On the connectivity of semiregular cages ⋮ Diameter-sufficient conditions for a graph to be super-restricted connected ⋮ On the number of components of \((k,g)\)-cages after vertex deletion ⋮ Edge-superconnectivity of semiregular cages with odd girth ⋮ Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages ⋮ Extraconnectivity of \(s\)-geodetic digraphs and graphs ⋮ (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur la séparation dans les graphes de Cayley abéliens
• Sufficient conditions for maximally connected dense graphs
• Large fault-tolerant interconnection networks
• A property of a-fragments of a digraph
• Vosperian and superconnected abelian Cayley digraphs
• Degree realization of undirected graphs in reduced form
• Results on the edge-connectivity of graphs
• On super-edge-connected digraphs and bipartite digraphs
• Maximally connected digraphs
• The connectivity of large digraphs and graphs
• A Graph-Theoretic Approach to a Communications Problem

This page was built for publication: On the order and size of \(s\)-geodetic digraphs with given connectivity