The k-diameter component edge connectivity parameter

DOI10.2140/INVOLVE.2018.11.845MaRDI QIDQ1747264zbMATH OpenOpenAlexWikidataFDO

Authors Adam Buzzard, Nathan B. Shank

Publication date 4 May 2018

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2018.11.845

zbMATH Keywords

conditional connectivityconnectivityedge failurenetwork reliability

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Applications of graph theory (05C90) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On component order edge connectivity of a complete bipartite graph.
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• Realizability results involving two connectivity parameters.
• Component order edge connectivity -- an introduction
• On \(k\)-diameter of \(k\)-connected graphs

Cites work

• A survey of some network reliability analysis and synthesis results
• Conditional connectivity
• scientific article; zbMATH DE number 1472195 (Why is no real title available?)

This page was built for publication: The \(k\)-diameter component edge connectivity parameter

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