3-restricted edge cut of graphs

zbMATH Open1107.05053MaRDI QIDQ854600FDOQ854600

Authors: Jianping Ou, Fuji Zhang 

Publication date: 6 December 2006

Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

Recommendations

• Minimally 3-restricted edge connected graphs
• Edge cuts leaving components of order at least \(m\)
• scientific article; zbMATH DE number 2108137
• \(m\)-restricted edge cut of graphs with 4 circumference and 3 free
• A proof of an inequality concerning \(k\)-restricted edge connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Cited In (7)

• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• \(m\)-restricted edge cut of graphs with 4 circumference and 3 free
• Super cyclically edge-connected vertex-transitive graphs of girth at least 5
• Title not available (Why is that?)
• On computing of a conditional edge connectivity of alternating group network
• Edge cuts leaving components of order at least \(m\)
• On edge cut of graphs leaving components of order at least five

This page was built for publication: 3-restricted edge cut of graphs

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