Realizability results involving two connectivity parameters.

zbMATH Open1174.05070MaRDI QIDQ5310249FDOQ5310249

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

Publication date: 21 September 2007

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

zbMATH Keywords

component order connectivityfailure state

Mathematics Subject Classification ID

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

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)
• Title not available (Why is that?)
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• Component order connectivity and vertex degrees
• Extremal connectivity and vulnerability in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)