Abstract
Construction of non-isomorphic cospectral graphs is a nontrivial problem in spectral graph theory especially for large graphs. In this paper, we establish that graph theoretical partial transpose of a graph is a potential tool to create non-isomorphic cospectral graphs by considering a graph as a partitioned graph.
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.
