Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal

From MaRDI portal
Publication:864174

DOI10.1016/j.disc.2006.06.028zbMath1177.05067OpenAlexW2054706367MaRDI QIDQ864174

Jinjiang Yuan, Zhao Zhang

Publication date: 13 February 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.028




Related Items (26)

Optimally restricted edge connected elementary Harary graphsSufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of GraphsSufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connectedOn optimizing edge connectivity of product graphs\(k\)-restricted edge-connectivity in triangle-free graphsEdge fault tolerance of super edge connectivity for three families of interconnection networks\(\lambda^{\prime}\)-optimality of bipartite digraphsSufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connectedThe \(k\)-restricted edge connectivity of balanced bipartite graphsSuper \(\lambda_3\)-optimality of regular graphsMaximally edge-connected and vertex-connected graphs and digraphs: A survey\(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphsCyclic sums, network sharing, and restricted edge cuts in graphs with long cyclesSufficient conditions for restricted-edge-connectivity to be optimalK-restricted edge connectivity for some interconnection networksEdge fault tolerance analysis of super \(k\)-restricted connected networksSufficient conditions for \(\lambda _k\)-optimality in triangle-free graphsSufficient conditions for a graph to be λ k -optimal with given girth and diameterSome remarks on \(\lambda _{p,q}\)-connectednessDiameter-sufficient conditions for a graph to be super-restricted connectedSufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)Minimally 3-restricted edge connected graphs3-restricted connectivity of graphs with given girthSufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connectedThe \(k\)-restricted edge connectivity of undirected Kautz graphs



Cites Work


This page was built for publication: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal