Abstract
In this paper we study the class G of all connected bipartite graphs whose adjacency spectrum, apart from the maximum and the minimum eigenvalue, just contains 0 and ±1. It turns out that G consists of five infinite families, each of them containing an infinite subfamily of integral graphs, and seven sporadic graphs. Moreover, we find all graphs in G determined by their spectrum and identify the cospectral mates of the remaining ones.
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.
