Premium
A Construction of Locally Homogeneous Graphs
Author(s) -
Weetman G. M.
Publication year - 1994
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/50.1.68
Subject(s) - combinatorics , mathematics , vertex (graph theory) , symmetric graph , homogeneous , graph , discrete mathematics , line graph , voltage graph
Given a regular graph Γ 0 of girth at least six, we show that a connected graph may be constructed in which the induced graph on the neighbours of any vertex is isomorphic to Γ 0 . The class of graphs arising through a generalisation of the construction is discussed and characterised in terms of simplicial complexes.