Electronic Resource
Springer
Graphs and combinatorics
12 (1996), S. 283-293
ISSN:
1435-5914
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract We construct an infinite family{Γ n}n=5 of finite connected graphsΓ n that are multiple extensions of the well-known “extended grid” discovered in [1] (which is isomorphic toΓ 5). The graphsΓ n are locallyΓ n−1 forn 〉 5, and have the following property: the automorphism groupG(n) ofΓ n permutes transitively the maximal cliques ofΓ n (which aren-cliques) and the stabilizer of somen-cliqueπ ofΓ n inG(n) inducesΣ n on the vertices ofπ. Furthermore we show that the clique complexes of the graphsΓ n are simply connected.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01858461
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |