On graphs in which the neighborhood of each vertex is isomorphic to the Higman-Sims graph

DOI10.1134/S1064562411040119zbMath1236.05132OpenAlexW1968888989MaRDI QIDQ656380

M. L. Kardanova, Aleksandr Alekseevich Makhnev, Dmitriĭ Viktorovich Paduchikh

Publication date: 17 January 2012

Published in: Doklady Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

strongly regular graphamply regular graphHigman-Sims graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Graphs \(G\) in which \(G-N[v\) has a prescribed property for each vertex \(v\)] ⋮ Graphs in which neighborhoods of vertices are isomorphic to the Mathieu graph ⋮ Graphs in which \(G - N[v\) is a cycle for each vertex \(v\)]

Cites Work

• On graphs in which the neighborhood of each vertex is the complementary graph of a Seidel graph
• On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph
• On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph
• The nonexistence of rank three permutation groups of degree 3250 and subdegree 57

This page was built for publication: On graphs in which the neighborhood of each vertex is isomorphic to the Higman-Sims graph