scientific article; zbMATH DE number 1472195

MaRDI QIDQ4489250zbMATH OpenFDO

Authors F. T. Boesch, Charles L. Suffel, Daniel J. Gross

Publication date 13 December 2000

zbMATH Keywords

communication networksedge connectivityreliabilityvulnerability measure

Mathematics Subject Classification ID

Connectivity (05C40) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On component order edge connectivity of a complete bipartite graph.
• Realizability results involving two connectivity parameters.
• scientific article; zbMATH DE number 1161336
• Connectivity
• Component order edge connectivity -- an introduction

Cited in

(11)

• Graph vulnerability parameters, compression, and quasi-threshold graphs
• The \(k\)-diameter component edge connectivity parameter
• On component order edge connectivity of a complete bipartite graph.
• scientific article; zbMATH DE number 4170962 (Why is no real title available?)
• Incorporating dependent node damage in deterministic connectivity analysis and synthesis of networks
• Realizability results involving two connectivity parameters.
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• A linear algorithm for the neighbor-component order connectivity of arbitrary trees
• Fundamental problems on bounded-treewidth graphs: the real source of hardness
• An algorithm for the domination number and neighbor-component order connectivity of a unicycle
• Proportional component order network connectivity

This page was built for publication:

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