Component order edge connectivity -- an introduction

MaRDI QIDQ3429563zbMATH OpenFDO

Authors F. T. Boesch, L. William Kazmierczak, Charles L. Suffel, Antonius Suhartomo, Daniel J. Gross

Publication date 2 April 2007

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Bounds for the component order edge connectivity
• On component order edge connectivity of a complete bipartite graph.
• Realizability results involving two connectivity parameters.
• Edge-cuts leaving components of order at least three
• Component order edge connectivity for graphs of fixed size and order.

Cited in

(12)

• Edge-orders
• The \(k\)-diameter component edge connectivity parameter
• The relationship between neighbor-connectivity, component order connectivity and neighbor-component order connectivity
• On component order edge connectivity of a complete bipartite graph.
• A generalization of an edge-connectivity theorem of Chartrand
• Component order edge connectivity for graphs of fixed size and order.
• scientific article; zbMATH DE number 1472195 (Why is no real title available?)
• Realizability results involving two connectivity parameters.
• Bounds for the component order edge connectivity
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• A linear algorithm for the neighbor-component order connectivity of arbitrary trees
• Proportional component order network connectivity

This page was built for publication: Component order edge connectivity -- an introduction

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