Bounding \(\ell\)-edge-connectivity in edge-connectivity

DOI10.1016/J.DAM.2022.07.011zbMATH Open1497.05136OpenAlexW4290052327WikidataQ113877175 ScholiaQ113877175MaRDI QIDQ2172417

Yanyan Li

Publication date: 15 September 2022

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

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

zbMATH Keywords

circulant graphsedge-connectivityvertex transitive graphs\(\ell\)-edge-connectivityedge-uniformly densemaximum subgraph edge-connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Minimale \(n\)-fach kantenzusammenhängende Graphen
• A Generalization of Line Connectivity and Optimally Invulnerable Graphs
• Edge‐maximal (k, i)‐graphs
• The size of strength‐maximal graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

Related Items (1)

Reliability analyses of regular graphs based on edge-structure connectivity

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Edge bounds in nonhamiltonian \(k\)-connected graphs 👍 👎
• Bounded edge-connectivity and edge-persistence of Cartesian product of graphs 👍 👎
• On the \(\ell\)-connectivity of a graph 👍 👎
• Bound on \(m\)-restricted edge connectivity 👍 👎
• Edge-connectivity in \(P_k\)-path graphs 👍 👎
• On the generalized (edge-)connectivity of graphs 👍 👎
• Boundary-connectivity via graph theory 👍 👎

This page was built for publication: Bounding \(\ell\)-edge-connectivity in edge-connectivity