Number of minimum vertex cuts in transitive graphs

DOI10.1016/S0012-365X(03)00133-XzbMath1028.05049MaRDI QIDQ1406564

Zhao Zhang, Ji Xiang Meng

Publication date: 4 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

connectivityvertex transitive graphsvertex cuts

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (2)

Reduction graph and its application on algebraic graphs ⋮ Solution methods for the vertex variant of the network system vulnerability analysis problem

Cites Work

• Unnamed Item
• Vosperian and superconnected abelian Cayley digraphs
• On the connectivity of Cayley digraphs
• On the construction of optimally reliable graphs
• On the design of reliable networks
• Circulants and their connectivities
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Extremal connectivity and vulnerability in graphs
• On the Invulnerability of the Regular Complete k-Partite Graphs

This page was built for publication: Number of minimum vertex cuts in transitive graphs