Diameter, short paths and superconnectivity in digraphs
From MaRDI portal
Publication:704288
DOI10.1016/J.DISC.2004.06.011zbMATH Open1062.05085OpenAlexW2116957247MaRDI QIDQ704288FDOQ704288
Xavier Marcote, C. Balbuena, I. 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
Recommendations
- Superconnectivity of bipartite digraphs and graphs
- On the superconnectivity and the conditional diameter of graphs and digraphs
- Connectedness of digraphs and graphs under constraints on the conditional diameter
- Superconnected digraphs and graphs with small conditional diameters
- On the superconnectivity in graphs with odd girth \(g\) and even girth \(h\)
- Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
- On super-edge-connected digraphs and bipartite digraphs
- Sufficient conditions for maximally edge-connected and super-edge-connected digraphs depending on the size
- The superconnectivity of large digraphs and graphs
- Super-edge-connectivity properties of graphs with diameter 2
Cites Work
- Circulants and their connectivities
- Conditional connectivity
- Synthesis of reliable networks - a survey
- Line Digraph Iterations and the (d, k) Digraph Problem
- Title not available (Why is that?)
- Maximally connected digraphs
- Minimal Regular Graphs of Girths Eight and Twelve
- On the linegraph of a directed-graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Super edge-connectivity of dense digraphs and graphs
- Using a progressive withdrawal procedure to study superconnectivity in digraphs
- Title not available (Why is that?)
Cited In (9)
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- The number of shortest paths in the (n, k)-star graph
- On the super‐restricted arc‐connectivity of s ‐geodetic digraphs
- Sufficient conditions for super-arc-strongly connected oriented graphs
- Distance formula and shortest paths for the \((n,k)\)-star graphs
- On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
- Title not available (Why is that?)
- Superconnected digraphs and graphs with small conditional diameters
- Connectedness of digraphs and graphs under constraints on the conditional diameter
This page was built for publication: Diameter, short paths and superconnectivity in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704288)
