On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph
From MaRDI portal
Publication:1048540
DOI10.1134/S1064562409050147zbMath1285.05128MaRDI QIDQ1048540
Dmitriĭ Viktorovich Paduchikh, Aleksandr Alekseevich Makhnev, Alexander L. Gavrilyuk
Publication date: 12 January 2010
Published in: Doklady Mathematics (Search for Journal in Brave)
Association schemes, strongly regular graphs (05E30) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (8)
On automorphisms of strongly regular graphs with parameters (486, 100, 22, 20) ⋮ Graphs \(G\) in which \(G-N[v\) has a prescribed property for each vertex \(v\)] ⋮ On strongly regular graphs with eigenvalue 2 and their extensions ⋮ On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\) ⋮ On graphs in which neighborhoods of vertices are isomorphic to the Higman-Sims graph ⋮ On graphs in which the neighborhood of each vertex is isomorphic to the Higman-Sims graph ⋮ Distance-regular graph with the intersection array \(\{56, 45, 1; 1, 9, 56\}\) is not vertex-symmetric ⋮ Graphs in which \(G - N[v\) is a cycle for each vertex \(v\)]
Cites Work
- Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph
- A new feasibility condition for distance-regular graphs
- The connectivity of strongly regular graphs
- The Gewirtz graph: An exercise in the theory of graph spectra
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
- Unnamed Item
This page was built for publication: On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph
