Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/9014| Title: | Constructing cospectral graphs by unfolding non-bipartite graphs |
| Authors: | Kannan, M. Rajesh Pragada, Shivaramakrishna WANKHEDE, HITESH Dept. of Mathematics |
| Keywords: | Adjacency matrix Cospectral graphs Partitioned tensor product Reflexive and semi reflexive graphs Unfolding 2024 2024-JUL-WEEK1 TOC-JUL-2024 |
| Issue Date: | Nov-2024 |
| Publisher: | Elsevier B.V. |
| Citation: | Discrete Applied Mathematics, 357, 264-273. |
| Abstract: | In 2010, Butler introduced the unfolding operation on a bipartite graph to produce two bipartite graphs, which are cospectral for the adjacency and the normalized Laplacian matrices. In this article, we describe how the idea of unfolding a bipartite graph with respect to another bipartite graph can be extended to nonbipartite graphs. In particular, we describe how unfoldings involving reflexive bipartite, semi-reflexive bipartite, and multipartite graphs are used to obtain cospectral nonisomorphic graphs for the adjacency matrix. |
| URI: | https://doi.org/10.1016/j.dam.2024.06.016 http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/9014 |
| ISSN: | 0166-218X 1872-6771 |
| Appears in Collections: | JOURNAL ARTICLES |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.