The distance spectrum of B(G), the bipartite double cover of a strongly regular graph G with parameters (n,k,a,c), is explicitly determined from the spectrum of G.
The line graph of the crown graph is distance integral, Linear and Multilinear Algebra 71, no
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The distance spectrum of the bipartite double cover of strongly regular graphs
The distance spectrum of B(G), the bipartite double cover of a strongly regular graph G with parameters (n,k,a,c), is explicitly determined from the spectrum of G.