{"title":"Construction of Simultaneous Cospectral Graphs for Adjacency, Laplacian and Normalized Laplacian Matrices","authors":"Arpita Das, P. Panigrahi","doi":"10.46793/kgjmat2306.947d","DOIUrl":null,"url":null,"abstract":"In this paper we construct several classes of non-regular graphs which are co-spectral with respect to all the three matrices, namely, adjacency, Laplacian and normalized Laplacian, and hence we answer a question asked by Butler [?]. We make these constructions starting with two pairs (G1, H1) and (G2, H2) of A-cospectral regular graphs, then considering the subdivision graphs S(Gi) and R-graphs ℛ(Hi), i = 1, 2, and finally making some kind of partial joins between S(G1) and ℛ(G2) and S(H1) and ℛ(H2). Moreover, we determine the number of spanning trees and the Kirchhoff index of the newly constructed graphs.","PeriodicalId":44902,"journal":{"name":"Kragujevac Journal of Mathematics","volume":" 34","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kragujevac Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46793/kgjmat2306.947d","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper we construct several classes of non-regular graphs which are co-spectral with respect to all the three matrices, namely, adjacency, Laplacian and normalized Laplacian, and hence we answer a question asked by Butler [?]. We make these constructions starting with two pairs (G1, H1) and (G2, H2) of A-cospectral regular graphs, then considering the subdivision graphs S(Gi) and R-graphs ℛ(Hi), i = 1, 2, and finally making some kind of partial joins between S(G1) and ℛ(G2) and S(H1) and ℛ(H2). Moreover, we determine the number of spanning trees and the Kirchhoff index of the newly constructed graphs.