✦ LIBER ✦

On Terwilliger graphs with µ = 4

✍ Scribed by A. L. Gavrilyuk

Book ID: 110189935
Publisher: SP MAIK Nauka/Interperiodica
Year: 2009
Tongue: English
Weight: 352 KB
Volume: 267
Category: Article
ISSN: 0081-5438
DOI: 10.1134/s0081543809070098

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On regular Terwilliger graphs with μ=2

✍ A. A. Makhnëv 📂 Article 📅 1996 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 190 KB

Automorphisms of Terwilliger graphs with

Automorphisms of Terwilliger graphs withμ= 2

✍ A. L. Gavrilyuk; Wenbin Guo; A. A. Makhnev 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 448 KB

On the regularity problem in Terwilliger

On the regularity problem in Terwilliger graphs

✍ A. L. Gavrilyuk; A. A. Makhnev 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 152 KB

Graphs with constant μ and μ

✍ Edwin R. van Dam; Willem H. Haemers 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 803 KB

A graph G has constant # = #(G) if any two vertices that are not adjacent have # common neighbours. G has constant/~ and fi if G has constant ~ = #(G), and its complement G has constant fi = #(G). If such a graph is regular, then it is strongly regular, otherwise precisely two vertex degrees occur.

Distance-regular graphs with girth 3 or

Distance-regular graphs with girth 3 or 4: I

✍ Paul Terwilliger 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 913 KB

On strongly regular graphs with μ ≥ 2

✍ Bhaskar Bagchi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 59 KB