k-restricted edge connectivity in (p+1)-clique-free graphs

DOI10.1016/J.DAM.2014.10.008MaRDI QIDQ479049zbMATH OpenOpenAlexFDO

Authors Lei Zhang, Shiying Wang, Shangwei Lin

Publication date 5 December 2014

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

Full work available at URL https://doi.org/10.1016/j.dam.2014.10.008

zbMATH Keywords

cliqueinterconnection networkrestricted edge connectivity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Recommendations

• Sufficient conditions for k-restricted edge connected graphs
• Sufficient conditions for restricted-edge-connectivity to be optimal
• A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
• Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
• \(k\)-restricted edge-connectivity in triangle-free graphs

Cites work

• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• A bound on 4-restricted edge connectivity of graphs
• A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Edge-cuts leaving components of order at least three
• Extraconnectivity of graphs with large girth
• Graph theory
• Neighborhood conditions for graphs to be super restricted edge connected
• On a kind of reliability analysis of networks
• On computing a conditional edge-connectivity of a graph
• Sufficient conditions for '-optimality in graphs of diameter 2
• Sufficient conditions for maximally restricted edge connected graphs
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
• Sufficient conditions for λ′‐optimality in graphs with girth g
• Super restricted edge connectivity of regular graphs with two orbits
• Super restricted edge-connectivity of graphs with diameter 2
• The \(k\)-restricted edge-connectivity of a product of graphs
• \(k\)-restricted edge-connectivity in triangle-free graphs

Cited in

(10)

• On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
• \(k\)-restricted edge-connectivity in triangle-free graphs
• The k-restricted edge connectivity of undirected Kautz graphs
• Arc fault tolerance of Kautz digraphs
• scientific article; zbMATH DE number 2245640 (Why is no real title available?)
• Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
• An anti-Ramsey theorem of \(k\)-restricted edge-cuts
• Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
• The \(p\)-restricted edge-connectivity of Kneser graphs
• On the complexity of computing the \(k\)-restricted edge-connectivity of a graph

This page was built for publication: \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs

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