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

DOI10.1134/S1064562411040119zbMATH Open1236.05132OpenAlexW1968888989MaRDI QIDQ656380FDOQ656380

Alexandre A. Makhnev, Dmitriĭ Viktorovich Paduchikh, M. L. Kardanova

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

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

Cites Work

• 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 the complementary graph of a Seidel 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

Cited In (6)

• On distance-regular 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\)
• Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
• Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
• Graphs in which neighborhoods of vertices are isomorphic to the Mathieu graph

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

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