On the Invulnerability of the Regular Complete k-Partite Graphs

DOI10.1137/0120023MaRDI QIDQ5628161zbMATH OpenOpenAlexFDO

Authors

Publication date 1971

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0120023

Mathematics Subject Classification ID

Connectivity (05C40)

Cited in

(8)

• Uniformly optimal graphs in some classes of graphs with node failures
• Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
• Optimally reliable networks
• Super edge-connectivity of dense digraphs and graphs
• Number of minimum vertex cuts in transitive graphs
• Optimally Reliable Graphs for Both Vertex and Edge Failures
• Uniformly optimally reliable graphs: A survey
• Node and link vulnerability in complete multipartite networks

This page was built for publication: On the Invulnerability of the Regular Complete k-Partite Graphs

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