The vertex connectivity of a (0,2)-graph equals its degree

A.E. Brouwer, H.M. Mulder

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)153-155
Number of pages3
JournalDiscrete Mathematics
Volume169
Issue number1-3
DOIs
Publication statusPublished - 1997

Cite this