𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automorphisms of Terwilliger graphs withμ= 2

✍ Scribed by A. L. Gavrilyuk; Wenbin Guo; A. A. Makhnev

Publisher
Springer US
Year
2008
Tongue
English
Weight
448 KB
Volume
47
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Terwilliger Algebra of a 2-Homogeneo
The Terwilliger Algebra of a 2-Homogeneous Bipartite Distance-Regular Graph
✍ Brian Curtin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Let 1 denote a 2-homogeneous bipartite distance-regular graph with diameter D 3 and valency k 3. Assume that 1 is not isomorphic to a Hamming cube. Fix a vertex x of 1, and let T=T(x) denote the Terwilliger algebra of T with respect to x. We give three sets of generators for T, two of which satisfy

Strongly Regular Square-free Graphs with
Strongly Regular Square-free Graphs with μ=2
✍ Benjamin V.C. Collins 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 277 KB

By a square in an undirected graph ⌫ , we mean a cycle x , y , z , w such that x is not adjacent to z and y is not adjacent to w . Suppose that ⌫ is a strongly regular graph with ϭ 2 , and assume that ⌫ does not contain a square . Pick any vertex x of ⌫ and let ⌫ Ј denote the induced subgraph on the

Automorphism Groups of Graphs with Quadr
Automorphism Groups of Graphs with Quadratic Growth
✍ Norbert Seifter; Vladimir I. Trofimov 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Let 1 be a graph with almost transitive group Aut(1) and quadratic growth. We show that Aut(1) contains an almost transitive subgroup isomorphic to the free abelian group Z 2 .

Automorphism groups of graphs with 1-fac
Automorphism groups of graphs with 1-factorizations
✍ Ulrike Baumann 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 523 KB

A l-factorization cp of a simple undirected connected graph G is an edge colouring such that each vertex is incident with exactly one edge of each colour. The automorphisms which preserve the colours of all edges constitute a group A,(G, q). We prove every finitely generated group H to be isomorphic