Abstract
The spectrum of the normalized Laplacian matrix of a graph provides many structural information of the graph, and it has many applications in numerous areas and in different guises. Let G be a complete k-partite graph with k≥3. In this paper, we give the necessary and sufficient condition for G which is determined by their normalized Laplacian spectrum. Moreover, we obtain a majorization theory of normalized Laplacian spectral radius of G, which enables us to find the maximal and minimal normalized Laplacian spectral radii among all complete k-partite graphs with fixed order, respectively.
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.
