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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
