Realizability results involving two connectivity parameters.

MaRDI QIDQ5310249zbMATH OpenFDO

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

Publication date 21 September 2007

zbMATH Keywords

component order connectivityfailure state

Mathematics Subject Classification ID

Connectivity (05C40) Network design and communication in computer systems (68M10)

Recommendations

• On component order edge connectivity of a complete bipartite graph.
• Component order edge connectivity -- an introduction
• scientific article; zbMATH DE number 2076929
• Publication:4489250
• scientific article; zbMATH DE number 205336

Cited in

(12)

• The relationship between neighbor-connectivity, component order connectivity and neighbor-component order connectivity
• On component order edge connectivity of a complete bipartite graph.
• Component order edge connectivity -- an introduction
• The \(k\)-diameter component edge connectivity parameter
• Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity)
• scientific article; zbMATH DE number 2188360 (Why is no real title available?)
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• Component order connectivity and vertex degrees
• Extremal connectivity and vulnerability in graphs
• scientific article; zbMATH DE number 3916308 (Why is no real title available?)
• scientific article; zbMATH DE number 1472195 (Why is no real title available?)
• Incorporating dependent node damage in deterministic connectivity analysis and synthesis of networks

This page was built for publication: Realizability results involving two connectivity parameters.

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