×

The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree. (English) Zbl 0873.05062

Summary: The first author observed that nice graphs are regular and have vertex connectivity equal to the degree. The second author observed that \(\{0,2\}\)-graphs are nice. This note follows immediately.

MSC:

05C40 Connectivity
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Brouwer, A. E.; Cohen, A. M.; Neumaier, A., Distance-Regular Graphs (1989), Springer: Springer Berlin · Zbl 0747.05073
[2] Mulder, H. M., (0, λ)-graphs and \(n\)-cubes, Discrete Math., 28, 179-188 (1979) · Zbl 0418.05034
[3] Mulder, H. M., The Interval Function of a Graph, (Mathematical Centre Tracts, vol. 132 (1980), Mathematisch Centrum: Mathematisch Centrum Amsterdam) · Zbl 0446.05039
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.