Constructing cospectral graphs by unfolding non-bipartite graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912128225509376 |
|---|---|
| author | Kannan, M. Rajesh Pragada, Shivaramakrishna Wankhede, Hitesh |
| author_facet | Kannan, M. Rajesh Pragada, Shivaramakrishna Wankhede, Hitesh |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_03035 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Constructing cospectral graphs by unfolding non-bipartite graphs Kannan, M. Rajesh Pragada, Shivaramakrishna Wankhede, Hitesh Combinatorics 05C50 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. |
| title | Constructing cospectral graphs by unfolding non-bipartite graphs |
| topic | Combinatorics 05C50 |
| url | https://arxiv.org/abs/2401.03035 |