A neighborhood condition for graphs to be maximally k-restricted edge connected

DOI10.1016/J.IPL.2011.10.012MaRDI QIDQ763501zbMATH OpenOpenAlexFDO

Authors Lei Zhang, Shiying Wang, Shangwei Lin

Publication date 9 March 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.10.012

zbMATH Keywords

\(\lambda_k\)-optimality\(k\)-restricted edge connectivityinterconnection networksneighborhood

Mathematics Subject Classification ID

Connectivity (05C40) Applications of graph theory (05C90)

Recommendations

• Sufficient conditions for k-restricted edge connected graphs
• Sufficient conditions for restricted-edge-connectivity to be optimal
• Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected
• A sufficient condition for graphs to be \(\lambda_k\)-optimal
• Local restricted edge connectivity and restricted edge connectivity of graphs.

Cites work

• \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• Edge-cuts leaving components of order at least three
• Extraconnectivity of graphs with large girth
• Graph theory
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On computing a conditional edge-connectivity of a graph
• On restricted connectivities of permutation graphs
• On the restricted connectivity and superconnectivity in graphs with given girth
• Optimally super-edge-connected transitive graphs
• Sufficient conditions for '-optimality in graphs of diameter 2
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Sufficient conditions for λ′‐optimality in graphs with girth g
• Superconnectivity of bipartite digraphs and graphs

Cited in

(12)

• Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
• Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected
• A sufficient condition for graphs to be super \(k\)-restricted edge connected
• A sufficient condition for graphs to be \(\lambda_k\)-optimal
• Sufficient conditions for restricted-edge-connectivity to be optimal
• Local restricted edge connectivity and restricted edge connectivity of graphs.
• Sufficient conditions for k-restricted edge connected graphs
• A neigborhood union condition for nonadjacent vertices in graphs
• k-restricted edge connectivity in (p+1)-clique-free graphs
• Sufficient conditions for graphs to be maximally 4-restricted edge connected
• On the d-blocker number of k-ary n-cubes
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal

This page was built for publication: A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected

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