On maximal 3-restricted edge connectivity of regular graphs

DOI10.1080/00207160903165416MaRDI QIDQ3066962zbMATH OpenOpenAlexFDO

Authors Jianping Ou

Publication date 20 January 2011

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160903165416

zbMATH Keywords

reliabilityregular graphedge connectivityedge cuts counting

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Sufficient conditions for graphs to be maximally 3-restricted edge connected
• On the connectivity and restricted edge-connectivity of 3-arc graphs
• The edge-connectivity of strongly 3-walk-regular graphs
• 3-restricted connectivity of graphs with given girth
• Minimally 3-restricted edge connected graphs
• On the 3-restricted edge connectivity of permutation graphs
• scientific article; zbMATH DE number 2192189
• On 3-restricted edge connectivity of undirected binary Kautz graphs
• Upper bound on the third edge-connectivity of graphs
• On a kind of restricted edge connectivity of graphs

Cited in

(8)

• scientific article; zbMATH DE number 4031741 (Why is no real title available?)
• Maximum subgraph problem for 3-regular Knödel graphs and its wirelength
• Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
• Minimally 3-restricted edge connected graphs
• scientific article; zbMATH DE number 1192984 (Why is no real title available?)
• Upper bound on the third edge-connectivity of graphs
• On edge cut of graphs leaving components of order at least five
• Restricted edge connectivity of regular graphs

This page was built for publication: On maximal 3-restricted edge connectivity of regular graphs

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