2000 character limit reached
Constructing cospectral graphs by unfolding non-bipartite graphs
Published 5 Jan 2024 in math.CO | (2401.03035v2)
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.
- On a Hierarchy of Spectral Invariants for Graphs. In Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, and Daniel Lokshtanov, editors, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), volume 289 of Leibniz International Proceedings in Informatics (LIPIcs), pages 6:1–6:18, Dagstuhl, Germany, 2024. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
- Steve Butler. A note about cospectral graphs for the adjacency and normalized Laplacian matrices. Linear Multilinear Algebra, 58(3-4):387–390, 2010.
- Construction of cospectral graphs. Journal of Algebraic Combinatorics, 52(2):215–235, September 2020.
- C. Godsil and B. Mckay. Products of graphs and their spectra. In Louis R. A. Casse and Walter D. Wallis, editors, Combinatorial Mathematics IV, Lecture Notes in Mathematics, pages 61–72, Berlin, Heidelberg, 1976. Springer.
- Constructing cospectral graphs. Aequationes Math., 25(2-3):257–268, 1982.
- W. H. Haemers. Are almost all graphs determined by their spectrum? Notices of the South African Mathematical Society, 47:42–45, 2016.
- Richard H. Hammack. Proof of a conjecture concerning the direct product of bipartite graphs. European Journal of Combinatorics, 30(5):1114–1118, July 2009.
- Constructing cospectral bipartite graphs. Discrete Mathematics, 343(10):112020, October 2020.
- On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices. Linear Multilinear Algebra, 70(15):3009–3030, 2022.
- On the construction of cospectral nonisomorphic bipartite graphs. Discrete Math., 345(8):Paper No. 112916, 8, 2022.
- On a theorem of Godsil and McKay concerning the construction of cospectral graphs. Linear Algebra Appl., 603:265–274, 2020.
- Edwin R. van Dam and Willem H. Haemers. Which graphs are determined by their spectrum? volume 373, pages 241–272. 2003. Special issue on the Combinatorial Matrix Theory Conference (Pohang, 2002).
- Edwin R. van Dam and Willem H. Haemers. Developments on spectral characterizations of graphs. Discrete Math., 309(3):576–586, 2009.
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level p𝑝pitalic_p. Linear Algebra Appl., 563:154–177, 2019.
- Hitesh Wankhede. Constructing cospectral graphs using partitioned tensor product. MS Thesis. IISER Pune, 2021.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.