Results 41 to 50 of about 960 (155)
On distance signless Laplacian spectrum and energy of graphs
Electronic Journal of Graph Theory and Applications, 2018 The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G, defined as DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz +2 more
doaj +1 more source
Graphs with maximal signless Laplacian spectral radius
Linear Algebra and its Applications, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, Ting-Jung, Tam, Bit-Shun
openaire +2 more sources
Distance (signless) Laplacian spectral radius of uniform hypergraphs
Linear Algebra and its Applications, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hongying Lin, Bo Zhou, Yanna Wang
openaire +2 more sources
Upper and Lower Bounds for the Spectral Radius of Generalized Reciprocal Distance Matrix of a Graph
Mathematics, 2022 For a connected graph G on n vertices, recall that the reciprocal distance signless Laplacian matrix of G is defined to be RQ(G)=RT(G)+RD(G), where RD(G) is the reciprocal distance matrix, RT(G)=diag(RT1,RT2,⋯,RTn) and RTi is the reciprocal distance ...
Yuzheng Ma, Yubin Gao, Yanling Shao
doaj +1 more source
The signless Laplacian matrix of hypergraphs
Special Matrices, 2022 In this article, we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix to structural parameters of the hypergraph ...
Cardoso Kauê, Trevisan Vilmar
doaj +1 more source
Signless Laplacian spectral radius and matching in graphs
, 2020 The signless Laplacian matrix of a graph $G$ is given by $Q(G)=D(G)+A(G)$, where $D(G)$ is a diagonal matrix of vertex degrees and $A(G)$ is the adjacency matrix. The largest eigenvalue of $Q(G)$ is called the signless Laplacian spectral radius, denoted by $q_1=q_1(G)$.
Liu, Chang, Pan, Yingui, Li, Jianping
openaire +2 more sources
Maxima of the Q-index: graphs without long paths [PDF]
, 2013 This paper gives tight upper bound on the largest eigenvalue q(G) of the signless Laplacian of graphs with no paths of given order. The main ingredient of our proof is a stability result of its own interest, about graphs with large minimum degree and ...
Nikiforov, Vladimir, Yuan, Xiying
core +1 more source
On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue
Mathematics, 2021 The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the ...
Maryam Baghipur +3 more
doaj +1 more source
The Signless Laplacian Spectral Radius of Some Strongly Connected Digraphs
Indian Journal of Pure and Applied Mathematics, 2018 A \(\infty\)-digraph is a digraph consisting of many directed cycles with one common vertex. If Q is the signless Laplacian matrix of a strongly connected digraph G, the spectral radius of Q is called the signless Laplacian spectral radius of G. A \(\theta\)-graph is a graph consisting of three paths having the same end vertices.
Li, Xihe, Wang, Ligong, Zhang, Shangyuan
openaire +2 more sources
Maxima of the Q-index: forbidden even cycles [PDF]
, 2014 Let $G$ be a graph of order $n$ and let $q\left( G\right) $ be the largest eigenvalue of the signless Laplacian of $G$. Let $S_{n,k}$ be the graph obtained by joining each vertex of a complete graph of order $k$ to each vertex of an independent set of ...
Nikiforov, Vladimir, Yuan, Xiying
core +1 more source