arXiv Analytics

Sign in

arXiv:2002.00636 [math.CO]AbstractReferencesReviewsResources

On the construction of cospectral graphs for the adjacency and normalized Laplacian matrices

M. Rajesh Kannan, Shivaramakrishna Pragada

Published 2020-02-03Version 1

In [Steve Butler. A note about cospectral graphs for the adjacency and normalized Laplacian matrices. Linear Multilinear Algebra, 58(3-4):387-390, 2010.], Butler constructed a family of bipartite graphs, which are cospectral for both the adjacency and the normalized Laplacian matrices. In this article, we extend this construction for generating larger classes of bipartite graphs, which are cospectral for both the adjacency and the normalized Laplacian matrices. Also, we provide a couple of constructions of non-bipartite graphs, which are cospectral for the adjacency matrices but not necessarily for the normalized Laplacian matrices.

Related articles: Most relevant | Search more
arXiv:0908.3324 [math.CO] (Published 2009-08-23)
Determinants of adjacency matrices of graphs
arXiv:1002.1032 [math.CO] (Published 2010-02-04)
Adjacency Matrices of Configuration Graphs
arXiv:1405.3780 [math.CO] (Published 2014-05-15)
Hadamard Z2Z4Q8-codes. Constructions based on the rank and dimension of the kernel