Results 141 to 150 of about 42,138 (164)
Some of the next articles are maybe not open access.
On the (Signless) Laplacian Permanental Polynomials of Graphs
Graphs and Combinatorics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shunyi Liu
exaly +4 more sources
Moore-Penrose inverses of the signless Laplacian and edge-Laplacian of graphs [PDF]
Discrete Mathematics, 2021 The signless Laplacian Q and signless edge-Laplacian S of a given graph may or may not be invertible. The Moore-Penrose inverses of Q and S are studied. In particular, using the incidence matrix, we find combinatorial formulas of the Moore- Penrose inverses of Q and S for trees.
Sudipta Mallik, Ryan Hessert
exaly +4 more sources
On the bounds for signless Laplacian energy of a graph
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shariefuddin Pirzada, Hilal A Ganie
exaly +3 more sources
Graphs with maximum Laplacian and signless Laplacian Estrada index
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivan Gutman, Luis Medina, Maria Robbiano
exaly +4 more sources
Discrete Mathematics, Algorithms and Applications, 2018
The distance signless Laplacian spectral radius of a connected graph [Formula: see text] is the largest eigenvalue of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix of vertex ...
Abdollah Alhevaz +2 more
openaire +2 more sources
The distance signless Laplacian spectral radius of a connected graph [Formula: see text] is the largest eigenvalue of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix of vertex ...
Abdollah Alhevaz +2 more
openaire +2 more sources
On (distance) signless Laplacian spectra of graphs
Journal of Applied Mathematics and Computing, 2021Let Q(G), $${{\mathcal {D}}(G)}$$ and $${{\mathcal {D}}}^Q(G)={{\mathcal {D}}iag(Tr)} + {{\mathcal {D}}(G)}$$ be, respectively, the signless Laplacian matrix, the distance matrix and ...
B. R. Rakshith +2 more
openaire +1 more source
On the Distance Signless Laplacian Spectrum of Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alhevaz, A. +3 more
openaire +2 more sources
Bounds for the extreme eigenvalues of the laplacian and signless laplacian of a graph
Journal of Mathematical Sciences, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the signless Laplacian Estrada index of cacti
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kun Wang, Xiangfeng Pan, Wenjie Ning
openaire +3 more sources
Signless Laplacian and normalized Laplacian on the H-join operation of graphs
Discrete Mathematics, Algorithms and Applications, 2014In this paper, we consider a generalized join operation, that is, the H-join on graphs, where H is an arbitrary graph. In terms of the signless Laplacian and the normalized Laplacian, we determine the spectra of the graphs obtained by this operation on regular graphs.
Bao-Feng Wu +2 more
openaire +3 more sources