Unification of graph products and compatibility with switching

DOI10.1007/s00373-017-1848-6zbMath1386.05019arXiv1709.05800OpenAlexW2963875663MaRDI QIDQ1684950

Sho Kubota

Publication date: 12 December 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.05800

zbMATH Keywords

distance-regular graphHamming graphdual polar graphswitchinggraph product

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

New strongly regular graphs from finite geometries via switching ⋮ Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing cospectral graphs
• Some properties of the twisted Grassmann graphs
• The spectra of the local graphs of the twisted Grassmann graphs
• A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs
• Endomorphisms of twisted Grassmann graphs
• Godsil-McKay switching and twisted Grassmann graphs
• A new family of distance-regular graphs with unbounded diameter
• Godsil-McKay switching and isomorphism

This page was built for publication: Unification of graph products and compatibility with switching