Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph

DOI10.1134/S1064562408040212MaRDI QIDQ542222zbMATH OpenOpenAlexFDO

Authors Alexander L. Gavrilyuk, Alexandre A. Makhnev

Publication date 8 June 2011

Published in Doklady Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)

Recommendations

• Terwilliger graphs with \(\mu \leq \) 3
• On Terwilliger graphs with = 4
• On Terwilliger graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph
• On regular Terwilliger graphs with =2
• On the Koolen-Park inequality and Terwilliger graphs

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• On regular Terwilliger graphs with =2
• On the regularity problem in Terwilliger graphs
• Terwilliger graphs with \(\mu \leq \) 3

Cited in

(8)

• On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph
• Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
• Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
• Terwilliger graphs with \(\mu \leq \) 3
• On Terwilliger graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph
• Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
• Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
• On realizability of some graphs

This page was built for publication: Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph

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