More results on the distance (signless) Laplacian eigenvalues of graphs

arXiv1705.07419MaRDI QIDQ6286929FDOQ6286929

Authors: Jie Xue, Huiqiu Lin, Kinkar Ch. Das, Jinlong Shu 

Publication date: 21 May 2017

Abstract: Let $G$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. Let $Tr(G)$ be the diagonal matrix of vertex transmissions of $G$ and $D(G)$ be the distance matrix of $G$. The distance Laplacian matrix of $G$ is defined as $mathcalL(G)=Tr(G)-D(G)$. The distance signless Laplacian matrix of $G$ is defined as $mathcalQ(G)=Tr(G)+D(G)$. In this paper, we give a lower bound on the distance Laplacian spectral radius in terms of $D_1$, as a consequence, we show that $partia{l}_1^L(G)geqn+lceilfracnomegaceil$ where $omega$ is the clique number of $G$. Furthermore, we give some graft transformations, by using them, we characterize the extremal graph attains the maximum distance spectral radius in terms of $n$ and $omega$. Moreover, we also give bounds on the distance signless Laplacian eigenvalues of $G$, and give a confirmation on a conjecture due to Aouchiche and Hansen.

This page was built for publication: More results on the distance (signless) Laplacian eigenvalues of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286929)