On the distance connectivity of graphs and digraphs
From MaRDI portal
Publication:1322268
DOI10.1016/0012-365X(94)90157-0zbMATH Open0796.05058OpenAlexW2051244399MaRDI QIDQ1322268FDOQ1322268
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
inequalitiesdiameterdirected graphgirthmaximally connectededge-connectivitydirected distancevalencedistance connectivity
Cites Work
- Line Digraph Iterations and the (d, k) Digraph Problem
- Maximally connected digraphs
- On the linegraph of a directed-graph
- Bipartite graphs and digraphs with maximum connectivity
- Large fault-tolerant interconnection networks
- Sufficient conditions for maximally connected dense graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Cycles, Paths, Connectivity and Diameter in Distance Graphs
- Bounding the distance among longest paths in a connected graph
- Title not available (Why is that?)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Connectivity of large bipartite digraphs and graphs
- On extremal bipartite graphs with high girth
- Superconnectivity of bipartite digraphs and graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distance and connectivity measures in permutation graphs
- On the \(l\)-connectivity of a digraph
- Undirected distances and the postman-structure of graphs
- On the connectivity of bipartite distance-balanced graphs
- On computing the connectivities of graphs and digraphs
- Connectedness of digraphs and graphs under constraints on the conditional diameter
This page was built for publication: On the distance connectivity of graphs and digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322268)
