Abstract
Recently, the nullity, the algebraic multiplicity of the number zero in the spectrum of the adjacency matrix, of a molecular graph has received a lot of attention as it has a number of direct appli...
Highlights
Motivation for founding the theory of graph spectra has come from applications in Chemistry and Physics
Recently, the nullity, the algebraic multiplicity of the number zero in the spectrum of the adjacency matrix, of a molecular graph has received a lot of attention as it has a number of direct applications in organic chemistry
In this paper, using a wellknown result which presents the spectrum of a Cayley graph in terms of irreducible characters of the underlying group, and using representation and character of groups, we give a lower bound for the maximum nullity of Cayley graph, XS(G), where G = ⟨a⟩ is a cyclic group, or G = G1 × ⋯ × Gt such that G1 = ⟨a⟩ is a cyclic group and Gi is an arbitrary finite group, for 2 ≤ i ≤ t, with determine the spectrum of Cayley graphs
Summary
Received: 12 February 2018 Accepted: 03 April 2018 First Published: 11 April 2018
Sign-in/Register to view highlights & summary 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.
