A lower bound of the l-edge-connectivity and optimal graphs

MaRDI QIDQ3620525zbMATH OpenFDO

Authors Kamal P. Hennayake, Hong-Jian Lai, Yehong Shao, Lili Zhang

Publication date 14 April 2009

zbMATH Keywords

circulant graphsgeneralized edge connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 1998283
• Minimally (k, k)‐edge‐connected graphs
• Bounding \(\ell\)-edge-connectivity in edge-connectivity
• Bounds on the size of graphs of given order and \(l\)-connectivity
• scientific article; zbMATH DE number 6945770

Cited in

(8)

• Bounds on the size of graphs of given order and \(l\)-connectivity
• Characterization of minimally (2,l)-connected graphs
• Bounding \(\ell\)-edge-connectivity in edge-connectivity
• Lower bounds for locally highly connected graphs
• scientific article; zbMATH DE number 1998283 (Why is no real title available?)
• ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
• Distribution of coefficients of rank polynomials for random sparse graphs
• Lower bounds on the vertex-connectivity of digraphs and graphs

This page was built for publication: A lower bound of the \(l\)-edge-connectivity and optimal graphs

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