Graphs with the n‐e.c. adjacency property constructed from resolvable designs

Citations Over Time

Abstract

Abstract Only recently have techniques been introduced that apply design theory to construct graphs with the n ‐e.c. adjacency property. We supply a new random construction for generating infinite families of finite regular n ‐e.c. graphs derived from certain resolvable Steiner 2‐designs. We supply an extension of our construction to the infinite case, and thereby give a new representation of the infinite random graph. We describe a family of deterministic graphs in infinite affine planes which satisfy the 3‐e.c. property. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 294–306, 2009

Related Papers

• → Compressed Adjacency Matrices: Untangling Gene Regulatory Networks(2012)53 cited
• → On adjacency-distance spectral radius and spread of graphs(2019)5 cited
• → Adjacency Maps and Efficient Graph Algorithms(2022)3 cited
• → Characterization of finite subsets of Z2 having the extension property(1998)1 cited
• Research of the genetic-clustering algorithm considering the condition of planar adjacency relationship(2005)