Graphs with the n-e.c. adjacency property constructed from affine planes

C. A. Baker, Anthony Bonato, Julia M. Nowlin Brown, Tamás Szonyi

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

We give new examples of graphs with the n-e.c. adjacency property. Few explicit families of n-e.c. graphs are known, despite the fact that almost all finite graphs are n-e.c. Our examples are collinearity graphs of certain partial planes derived from affine planes of even order. We use probabilistic and geometric techniques to construct new examples of n-e.c. graphs from partial planes for all n, and we use geometric techniques to give infinitely many new explicit examples if n = 3. We give a new construction, using switching, of an exponential number of non-isomorphic n-e.c. graphs for certain orders.

Original languageEnglish
Pages (from-to)901-912
Number of pages12
JournalDiscrete Mathematics
Volume308
Issue number5-6
DOIs
Publication statusPublished - Mar 28 2008

Keywords

  • Adjacency property
  • Affine plane
  • Geometry
  • Graph
  • Switching
  • n-e.c. graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Graphs with the n-e.c. adjacency property constructed from affine planes'. Together they form a unique fingerprint.

  • Cite this