We construct an infinite family {Gamma(n)}(n=5) of finite connected graphs Gamma(n) that are multiple extensions of the well-known ''extended grid'' discovered in [1] (which is isomorphic to Gamma(5)). The graphs Gamma(n) are locally Gamma(n-1) for n > 5, and have the following property: the automorphism group G(n) of Gamma(n) permutes transitively the maximal cliques of Gamma(n) (which are n-cliques) and the stabilizer of some n-clique x of Gamma(n) in G(n) induces Sigma(n) on the vertices of pi. Furthermore we show that the clique complexes of the graphs Gamma(n) are simply connected.

Meixner, T., & Pasini, A. (1996). A family of multiply extended grids. GRAPHS AND COMBINATORICS, 12(3), 283-293 [10.1007/BF01858461].

A family of multiply extended grids

PASINI, ANTONIO
1996

Abstract

We construct an infinite family {Gamma(n)}(n=5) of finite connected graphs Gamma(n) that are multiple extensions of the well-known ''extended grid'' discovered in [1] (which is isomorphic to Gamma(5)). The graphs Gamma(n) are locally Gamma(n-1) for n > 5, and have the following property: the automorphism group G(n) of Gamma(n) permutes transitively the maximal cliques of Gamma(n) (which are n-cliques) and the stabilizer of some n-clique x of Gamma(n) in G(n) induces Sigma(n) on the vertices of pi. Furthermore we show that the clique complexes of the graphs Gamma(n) are simply connected.
Meixner, T., & Pasini, A. (1996). A family of multiply extended grids. GRAPHS AND COMBINATORICS, 12(3), 283-293 [10.1007/BF01858461].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11365/7084
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo