Proportional component order network connectivity

DOI10.70013/K9QC3VJ9MaRDI QIDQ7015822zbMATH OpenFDO

Authors Nicholas Hanson, Nathan B. Shank, Ashley Armbruster, Jiequi Di

Publication date 7 March 2025

Published in CONTACT. Communications on Number Theory and Combinatorial Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.70013/K9QC3VJ9

zbMATH Keywords

component ordernetwork connectivityvulnerability

Mathematics Subject Classification ID

Connectivity (05C40) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites work

• A Separator Theorem for Planar Graphs
• Component order edge connectivity -- an introduction
• Conditional connectivity
• scientific article; zbMATH DE number 1472195 (Why is no real title available?)
• On component order edge connectivity of a complete bipartite graph.
• On neighbor component order edge connectivity
• Some Extremal Properties of Bipartite Subgraphs
• The connectivity function of a graph
• The size of the largest bipartite subgraphs

This page was built for publication: Proportional component order network connectivity

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