Results 71 to 80 of about 121 (97)

Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs

Applied Mathematics and Computation, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jixiang Meng
exaly   +3 more sources

Distance signless Laplacian spectral radius for the existence of path-factors in graphs

Aequationes Mathematicae
Let \(G\) be a finite graph of order \(n\) with the vertex set \(\{v_1,v_2,\ldots,v_n\}\) and let \(F\) be a spanning subgraph of \(G\). Then, \(F\) is called a path factor if every component of \(F\) is a path of order at least 2. A \(P_{\geq k}\)-factor means a path factor in which every component admits order at least \(k (k \geq 2)\).
Zhiren Sun, Sizhong Zhou, Zhou Sizhong   +2 more
exaly   +2 more sources

On the distance signless Laplacian spectral radius of graphs

Linear and Multilinear Algebra, 2013
The distance signless Laplacian spectral radius of a connected graph G is the spectral radius of the distance signless Laplacian matrix of G, defined as where is the diagonal matrix of vertex transmissions of G and is the distance matrix of G. In this paper, we determine the graphs with minimum distance signless Laplacian spectral radius among the ...
Rundan Xing, Bo Zhou, Jianping Li
openaire   +1 more source

Note on distance signless Laplacian spectral radius under given matching number

Linear and Multilinear Algebra, 2020
Let ℜn,β be the family of graphs with n vertices and with the matching number β. The distance signless Laplacian spectral radius of a graph G is denoted by ρ(G).
Yan Liu, Jin Yan
openaire   +1 more source

Bounds on the distance signless Laplacian spectral radius in terms of clique number

Linear and Multilinear Algebra, 2014
The distance signless Laplacian spectral radius of a connected graph , denoted by , is the maximal eigenvalue of the distance signless Laplacian matrix of . In this paper, we find a sharp lower bound as well as a sharp upper bound of in terms of the clique number. Furthermore, both extremal graphs are uniquely determined.
Huiqiu Lin, Xiwen Lu
openaire   +1 more source

The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity

Linear Algebra and its Applications, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weige Xi, Wasin So, Ligong Wang
openaire   +2 more sources

Spanningk-trees and distance signless Laplacian spectral radius of graphs

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sizhong Zhou, Yuli Zhang, Hongxia Liu
openaire   +1 more source

Sufficient conditions for k-leaf-connected graphs on distance (signless Laplacian) spectral radius

Discrete Mathematics, Algorithms and Applications
Let [Formula: see text] be a graph and [Formula: see text] be a subset of [Formula: see text] with [Formula: see text]. A graph [Formula: see text] is called [Formula: see text]-leaf-connected if [Formula: see text] and [Formula: see text] always has a spanning tree [Formula: see text] such that [Formula: see text] is precisely the set of leaves of ...
Yu Zhang, Qiannan Zhou, Yong Lu
openaire   +1 more source

On the spectral radius of the reciprocal distance signless laplacian matrix

AIP Conference Proceedings, 2023
openaire   +1 more source

Note on distance signless Laplacian spectral radius under given matching number

Linear and Multilinear Algebra, 2022
Yan Liu
exaly