The connectivity of large digraphs and graphs
From MaRDI portal
Publication:4693342
DOI10.1002/JGT.3190170105zbMATH Open0783.05054OpenAlexW2165714031MaRDI QIDQ4693342
No author found.
Publication date: 3 January 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170105
distancediameterconnectivitydirected graphpathedge-connectivityMoore boundMoore grapharc-connectivityarc-graphs
Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Cites Work
Related Items (16)
Unnamed Item ⋮ Lower bounds on the vertex-connectivity of digraphs and graphs ⋮ On the order and size of \(s\)-geodetic digraphs with given connectivity ⋮ Connectivity of large bipartite digraphs and graphs ⋮ Bipartite graphs and digraphs with maximum connectivity ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\) ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ On local connectivity of graphs ⋮ On local connectivity of graphs with given clique number ⋮ The connectivity and minimum degree of circuit graphs of matroids ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\) ⋮ Super-connected arc-transitive digraphs ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ On the connectivity of \(p\)-diamond-free graphs ⋮ Graphs, friends and acquaintances ⋮ The superconnectivity of large digraphs and graphs
This page was built for publication: The connectivity of large digraphs and graphs
