Results 21 to 30 of about 1,618,968 (159)
Signless Laplacian determinations of some graphs with independent edges [PDF]
Karpatsʹkì Matematičnì Publìkacìï, 2018 Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the adjacency matrix of $G$, respectively.
R. Sharafdini, A.Z. Abdian
doaj +2 more sources
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs [PDF]
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +2 more sources
Some new sharp bounds for the spectral radius of a nonnegative matrix and its application [PDF]
Journal of Inequalities and Applications, 2017 In this paper, we give some new sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. Using these bounds, we obtain some new and improved bounds for the signless Laplacian spectral radius of a graph or a digraph.
Jun He +3 more
doaj +2 more sources
On distance signless Laplacian spectrum and energy of graphs [PDF]
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 +2 more sources
On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue [PDF]
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 +2 more sources
Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph
Applied Mathematics and Computation, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Chandra Das, A Sinan Çevik
exaly +6 more sources
The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 The sum-connectivity index of a graph G is defined as the sum of weights [Formula: see text] over all edges uv of G, where du and dv are the degrees of the vertices u and v in G, respectively.
A. Jahanbani, S. M. Sheikholeslami
doaj +3 more sources
On comparison between the distance energies of a connected graph [PDF]
HeliyonLet G be a simple connected graph of order n having Wiener index W(G). The distance, distance Laplacian and the distance signless Laplacian energies of G are respectively defined asDE(G)=∑i=1n|υiD|,DLE(G)=∑i=1n|υiL−Tr‾|andDSLE(G)=∑i=1n|υiQ−Tr‾|, where ...
Hilal A. Ganie +2 more
doaj +2 more sources
Spectral Characterizations of the Aα−-Matrix for Graph Products
International Journal of Mathematics and Mathematical SciencesFor α∈0,1, the matrix Aα−G=αDG+α−1AG defines a Laplacian–type operator associated with a graph G, interpolating between −AG and DG. In this paper, we develop a systematic study of the Aα−-spectrum under several classical graph products. Complete spectral
Zakeiah Alkhamisi +3 more
doaj +2 more sources
Journal of MathematicsThis study investigates the spectral and topological properties of rounded knot networks K2n, a helical extension of phenylene quadrilateral structures, through signless Laplacian spectral analysis.
Fareeha Hanif, Ali Raza, Md. Shajib Ali
doaj +2 more sources