On the Invulnerability of the Regular Complete k-Partite Graphs

DOI10.1137/0120023zbMath0223.05121OpenAlexW1969778549MaRDI QIDQ5628161

No author found.

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)

Related Items (7)

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

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