Abstract
The eigenvalues of a graph is the root of its characteristic polynomial. A fullerene F is a 3- connected graphs with entirely 12 pentagonal faces and n/2 -10 hexagonal faces, where n is the number of vertices of F. In this paper we investigate the eigenvalues of a class of fullerene 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.
