Abstract
An exceptional graph is a connected graph with least eigenvalue greater than or equal to -2 which is not a generalized line graph. There are finitely many exceptional graphs. Maximal exceptional graphs have been recently identified. In this paper we discuss some details related to the construction of maximal exceptional 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 callMore From: Publikacije Elektrotehni?kog fakulteta - serija: matematika
Disclaimer: 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.
