Sufficient conditions for maximally connected dense graphs
From MaRDI portal
Publication:1086585
DOI10.1016/0012-365X(87)90151-8zbMath0609.05050MaRDI QIDQ1086585
Hiroshi Nakada, Terunao Soneoka, Makoto Imase, Claudine Peyrat
Publication date: 1987
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (48)
Superconnected digraphs and graphs with small conditional diameters ⋮ Lower bounds on the vertex-connectivity of digraphs and graphs ⋮ Extraconnectivity of graphs with large minimum degree and girth ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Connectivity of graphs with given girth pair ⋮ Large fault-tolerant interconnection networks ⋮ On the order and size of \(s\)-geodetic digraphs with given connectivity ⋮ Connectivity of large bipartite digraphs and graphs ⋮ Lower connectivities of regular graphs with small diameter ⋮ On the extraconnectivity of graphs ⋮ Bipartite graphs and digraphs with maximum connectivity ⋮ Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) ⋮ Codes from incidence matrices of graphs ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\) ⋮ On average connectivity of the strong product of graphs ⋮ On the connectivity of \((k,g)\)-cages of even girth ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Sufficient conditions for restricted-edge-connectivity to be optimal ⋮ On the edge-connectivity and restricted edge-connectivity of a product of graphs ⋮ Local-edge-connectivity in digraphs and oriented graphs ⋮ Diameter and connectivity of (D; g)-cages ⋮ On local connectivity of graphs ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ On the connectivity and superconnected graphs with small diameter ⋮ New improvements on connectivity of cages ⋮ Unnamed Item ⋮ Connectedness of digraphs and graphs under constraints on the conditional diameter ⋮ A new bound for the connectivity of cages ⋮ On local connectivity of graphs with given clique number ⋮ Neighborhood conditions for graphs to be super restricted edge connected ⋮ Sufficient conditions for maximally edge-connected hypergraphs ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\) ⋮ On super edge-connectivity of product graphs ⋮ Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 ⋮ On the number of components of \((k,g)\)-cages after vertex deletion ⋮ Superconnectivity of regular graphs with small diameter ⋮ Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ On the connectivity of \(p\)-diamond-free graphs ⋮ On connectivity of the cartesian product of two graphs ⋮ Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages ⋮ Extraconnectivity of \(s\)-geodetic digraphs and graphs ⋮ On the Superconnectivity in graphs with odd girth g and even girth h ⋮ On the extremal eccentric connectivity index of graphs ⋮ Sufficient conditions for hypergraphs to be maximally edge-connected ⋮ The superconnectivity of large digraphs and graphs ⋮ Extraconnectivity of graphs with large girth ⋮ On the distance connectivity of graphs and digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large graphs with given degree and diameter. II
- Tables of large graphs with given degree and diameter
- Connectivity of Regular Directed Graphs with Small Diameters
- A Design for Directed Graphs with Minimum Diameter
- Lower-bounds on the connectivities of a graph
- Design to Minimize Diameter on Building-Block Network
This page was built for publication: Sufficient conditions for maximally connected dense graphs
