Abstract
In the present paper we are interested in the study of the distance Laplacian eigenvalues of a connected graph with fixed order n and chromatic number x. We prove lower bounds on the distance Laplacian spectral radius in terms of n and x. We also prove results related to the distribution of the distance Laplacian eigenvalues with respect to the values of the chromatic number x. For some of the results, we characterize the extremal graphs, for others, we give examples of extremal 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.
