A Note on Super Connectivity of the Bouwer Graph
Mei-Mei Gu, Jou–Ming Chang · Journal of Interconnection Networks · 2021
The Bouwer graph [Formula: see text], proposed in 1970, is defined for every triple [Formula: see text] of integers greater than [Formula: see text] with [Formula: see text]. It has many good properties, such as vertex-transitive and edge-transitive. Conder and Žitnik used a cycle-counting argument to prove that almost all of the Bouwer graphs are half-arc-transitive in 2016. In this paper, by exploring the structure properties of [Formula: see text], we investigate some reliability measures, including super connectivity and super-edge connectivity, and show that the super connectivity and super-edge connectivity of the Bouwer graph are both [Formula: see text] for [Formula: see text], [Formula: see text] and [Formula: see text].