Diameter, short paths and superconnectivity in digraphs

DOI10.1016/j.disc.2004.06.011zbMath1062.05085OpenAlexW2116957247MaRDI QIDQ704288

Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo

Publication date: 13 January 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.06.011

zbMATH Keywords

girthsuperconnectivitysemigirth

Mathematics Subject Classification ID

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

Related Items (7)

On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ The number of shortest paths in the (n, k)-star graph ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ Connectedness of digraphs and graphs under constraints on the conditional diameter ⋮ Distance formula and shortest paths for the \((n,k)\)-star graphs ⋮ Sufficient conditions for super-arc-strongly connected oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Super edge-connectivity of dense digraphs and graphs
• Using a progressive withdrawal procedure to study superconnectivity in digraphs
• On the linegraph of a directed-graph
• Line Digraph Iterations and the (d, k) Digraph Problem
• Circulants and their connectivities
• Conditional connectivity
• Synthesis of reliable networks - a survey
• Maximally connected digraphs
• Minimal Regular Graphs of Girths Eight and Twelve

This page was built for publication: Diameter, short paths and superconnectivity in digraphs