Lower bounds on the vertex-connectivity of digraphs and graphs
From MaRDI portal
Publication:845669
DOI10.1016/J.IPL.2006.03.001zbMATH Open1186.05077OpenAlexW2026147715MaRDI QIDQ845669FDOQ845669
Authors: Angelika Hellwig, Lutz Volkmann 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.03.001
Recommendations
- Lower-bounds on the connectivities of a graph
- scientific article; zbMATH DE number 1263999
- A lower bound of the \(l\)-edge-connectivity and optimal graphs
- Some new lower bounds on the algebraic connectivity of graphs
- Lower bounds on the vertex-connectivity of oriented graphs and bipartite oriented graphs
- Lower bounds for the algebraic connectivity of graphs with specified subgraphs
- scientific article; zbMATH DE number 1135766
- scientific article; zbMATH DE number 1835112
- On a lower bound for the connectivity of the independence complex of a graph
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
- On computing a conditional edge-connectivity of a graph
- Maximally connected digraphs
- Lower-bounds on the connectivities of a graph
- The connectivity of strongly regular graphs
- Bipartite graphs and digraphs with maximum connectivity
- Connectivity of Regular Directed Graphs with Small Diameters
- Title not available (Why is that?)
- Sufficient conditions for maximally connected dense graphs
- Connectivity of large bipartite digraphs and graphs
- Sufficient conditions for equality of connectivity and minimum degree of a graph
- The connectivity of large digraphs and graphs
Cited In (10)
- Title not available (Why is that?)
- On local connectivity of graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On the lower bound of \(k\)-maximal digraphs
- Computing Vertex Connectivity: New Bounds from Old Techniques
- Lower bounds on the vertex-connectivity of oriented graphs and bipartite oriented graphs
- Lower-bounds on the connectivities of a graph
- Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages
- Lower bounds for locally highly connected graphs
- Title not available (Why is that?)
This page was built for publication: Lower bounds on the vertex-connectivity of digraphs and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845669)
