New bounds on the distance Laplacian and distance signless Laplacian spectral radii
نویسندگان
چکیده
منابع مشابه
On Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs
Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...
متن کاملRemoteness and distance, distance (signless) Laplacian eigenvalues of a graph
Let G be a connected graph of order n. The remoteness of G, denoted by ρ, is the maximum average distance from a vertex to all other vertices. Let [Formula: see text], [Formula: see text] and [Formula: see text] be the distance, distance Laplacian and distance signless Laplacian eigenvalues of G, respectively. In this paper, we give lower bounds on [Formula: see text], [Formula: see text], [For...
متن کاملThe signless Laplacian spectral radii of modified graphs
In this paper, various modifications of a connected graph G are regarded as perturbations of its signless Laplacian matrix. Several results concerning the resulting changes to the signless Laplacian spectral radius of G are obtained by solving intermediate eigenvalue problems of the second type. AMS subject classifications: 05C50
متن کاملOrdering of the signless Laplacian spectral radii of unicyclic graphs
For n ≥ 11, we determine all the unicyclic graphs on n vertices whose signless Laplacian spectral radius is at least n− 2. There are exactly sixteen such graphs and they are ordered according to their signless Laplacian spectral radii.
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones (Antofagasta)
سال: 2019
ISSN: 0717-6279
DOI: 10.22199/issn.0717-6279-2019-04-0056