On the construction of cospectral nonisomorphic bipartite graphs
From MaRDI portal
Publication:2142656
DOI10.1016/j.disc.2022.112916zbMath1490.05166arXiv2110.09034OpenAlexW3207235054MaRDI QIDQ2142656
Hitesh Wankhede, M. Rajesh Kannan, Shivaramakrishna Pragada
Publication date: 27 May 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.09034
adjacency matrixnormalized Laplacian matrixpartitioned tensor productcospectral bipartite graphsHammack's cancellation law
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing cospectral graphs
- Spectra of graphs
- Constructing cospectral bipartite graphs
- Developments on spectral characterizations of graphs
- Proof of a conjecture concerning the direct product of bipartite graphs
- Which graphs are determined by their spectrum?
- Bounds for the extremal eigenvalues of gain Laplacian matrices
- The Kronecker Product of Graphs
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- Isomorphic components of Kronecker product of bipartite graphs
This page was built for publication: On the construction of cospectral nonisomorphic bipartite graphs