Extraconnectivity of \(s\)-geodetic digraphs and graphs

DOI10.1016/S0012-365X(98)00163-0zbMath0927.05049MaRDI QIDQ1296969

Camino Balbuena

Publication date: 5 December 1999

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

zbMATH Keywords

diameterdegreeconnectivityextraconnectivity\(s\)-geodetic digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items

\(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ On the restricted arc-connectivity of \(s\)-geodetic digraphs ⋮ 3-extra connectivity of 3-ary \(n\)-cube networks ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ Super-connected arc-transitive digraphs ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient conditions for maximally connected dense graphs
• Large fault-tolerant interconnection networks
• A property of a-fragments of a digraph
• Extraconnectivity of graphs with large minimum degree and girth
• On the order and size of \(s\)-geodetic digraphs with given connectivity
• On the extraconnectivity of graphs
• Circulants and their connectivities
• Conditional connectivity
• Maximally connected digraphs
• Strongly geodetic graphs