𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On regular Terwilliger graphs with μ=2

✍ Scribed by A. A. Makhnëv

Publisher
SP MAIK Nauka/Interperiodica
Year
1996
Tongue
English
Weight
190 KB
Volume
37
Category
Article
ISSN
0037-4466

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On Strongly Regular Graphs withμ =&
On Strongly Regular Graphs withμ =  1
✍ J. Deutsch; P.H. Fisher 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 75 KB

We consider strongly regular graphs in which each non-adjacent pair of vertices has exactly one common neighbour. These graphs give rise to partial linear spaces (one of which is a partial quadrangle) and a distance-regular graph of diameter three. The lower bound for the valency of the graph in ter