Classification of small (0,2)-graphs

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)

Abstract

We find the graphs of valency at most 7 with the property that any two nonadjacent vertices have either 0 or 2 common neighbours. In particular, we find all semibiplanes of block size at most 7.
Original languageEnglish
Pages (from-to)1636-1645
JournalJournal of Combinatorial Theory, Series A
Volume113
Issue number8
DOIs
Publication statusPublished - 2006

Fingerprint Dive into the research topics of 'Classification of small (0,2)-graphs'. Together they form a unique fingerprint.

  • Cite this