Click here to flash read.
arXiv:2401.03035v2 Announce Type: replace
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.
Click here to read this post out
ID: 831143; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: May 1, 2024, 7:32 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Views: 9
CC:
No creative common's license
No creative common's license
Comments: