Sufficient conditions for maximally connected dense graphs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A Design for Directed Graphs with Minimum Diameter
Design to Minimize Diameter on Building-Block Network
Lower-bounds on the connectivities of a graph
Connectivity of Regular Directed Graphs with Small Diameters
Large graphs with given degree and diameter. II
Tables of large graphs with given degree and diameter

Cited In (48)

On the distance connectivity of graphs and digraphs
On the extremal eccentric connectivity index of graphs
Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
Connectivity of graphs with given girth pair
New improvements on connectivity of cages
On local connectivity of graphs
Sufficient conditions for hypergraphs to be maximally edge-connected
Codes from incidence matrices of graphs
Maximally edge-connected and vertex-connected graphs and digraphs: A survey
Local-edge-connectivity in digraphs and oriented graphs
On the connectivity of \((k,g)\)-cages of even girth
On the edge-connectivity and restricted edge-connectivity of a product of graphs
Sufficient conditions for restricted-edge-connectivity to be optimal
A new bound for the connectivity of cages
On connectivity of the cartesian product of two graphs
The superconnectivity of large digraphs and graphs
Extraconnectivity of graphs with large girth
Super edge-connectivity of dense digraphs and graphs
Connectivity of large bipartite digraphs and graphs
On the order and size of \(s\)-geodetic digraphs with given connectivity
Diameter and connectivity of (D; g)-cages
On the connectivity of \(p\)-diamond-free graphs
Bipartite graphs and digraphs with maximum connectivity
Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
On average connectivity of the strong product of graphs
On the extraconnectivity of graphs
Superconnectivity of bipartite digraphs and graphs
Lower connectivities of regular graphs with small diameter
Lower bounds on the vertex-connectivity of digraphs and graphs
Sufficient conditions for maximally edge-connected hypergraphs
Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
On the number of components of \((k,g)\)-cages after vertex deletion
On the connectivity and superconnected graphs with small diameter
Superconnectivity of regular graphs with small diameter
Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages
On local connectivity of graphs with given clique number
On the superconnectivity in graphs with odd girth \(g\) and even girth \(h\)
Large fault-tolerant interconnection networks
New results on connectivity of cages
On super edge-connectivity of product graphs
Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
Neighborhood conditions for graphs to be super restricted edge connected
Superconnected digraphs and graphs with small conditional diameters
Extraconnectivity of \(s\)-geodetic digraphs and graphs
Extraconnectivity of graphs with large minimum degree and girth
Connectedness of digraphs and graphs under constraints on the conditional diameter

This page was built for publication: Sufficient conditions for maximally connected dense graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086585)