On the regularity problem in Terwilliger graphs

DOI10.1134/S1064562407060051MaRDI QIDQ957802zbMATH OpenFDO

Authors Alexander L. Gavrilyuk, Alexandre A. Makhnev

Publication date 1 December 2008

Published in Doklady Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1064562407060051

zbMATH Keywords

distance regular graphTerwilliger graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Association schemes, strongly regular graphs (05E30)

Recommendations

• On regular Terwilliger graphs with =2
• The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)
• Terwilliger graphs with \(\mu \leq \) 3
• On Terwilliger graphs with = 4
• Distance-regular Terwilliger graphs with intersection arrays \(\{50,42,1;1,2,50\}\) and \(\{50,42,9;1,2,42\}\) do not exist

Cites work

• A generalization of Moore graphs of diameter two
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• On regular Terwilliger graphs with =2

Cited in

(6)

• Maintaining regular properties dynamically in k-terminal graphs
• On regular Terwilliger graphs with =2
• scientific article; zbMATH DE number 3874608 (Why is no real title available?)
• scientific article; zbMATH DE number 4106910 (Why is no real title available?)
• Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph
• Terwilliger graphs with \(\mu \leq \) 3

This page was built for publication: On the regularity problem in Terwilliger graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q957802)