Results 101 to 110 of about 42,138 (164)
On Normalized Signless Laplacian Resolvent Energy
Kragujevac Journal of MathematicsSummary: Let \(G\) be a simple connected graph with \(n\) vertices. Denote by \(\mathcal{L}^+(G) =D(G)^{-1/2}Q(G) D(G)^{-1/2}\) the normalized signless Laplacian matrix of graph \(G\), where \(Q(G)\) and \(D(G)\) are the signless Laplacian and diagonal degree matrices of \(G\), respectively. The eigenvalues of matrix \(\mathcal{L}^+(G)\), \(2=\gamma_1^+
Altindağ, Ş. B. Bozkurt +3 more
openaire +2 more sources
On the signless Laplacian spectra of k-trees
Linear Algebra and its Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Minjie, Li, Shuchao
openaire +2 more sources
On the second largest eigenvalue of the signless Laplacian
, 2013 Let G be a graph of order n, and let q1(G)≥⋯≥q n(G) be the eigenvalues of the Q-matrix of G, also known as the signless Laplacian of G. We give a necessary and sufficient condition for the equality qk(G)=n-2, where
Nikiforov, Vladimir +1 more
core +1 more source
A sharp upper bound for the spectral radius of a nonnegative matrix and applications [PDF]
, 2011 summary:We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the distance ...
Shu, Yujie +5 more
core +1 more source
On the Laplacian and signless Laplacian spectra of complete multipartite graphs [PDF]
, 2017 Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adjacency matrix of G is an (nn)-matrix A(G) = [aij] where aij = 1 if vivj E(G) and aij = 0 elsewhere, and the degree matrix of G is a diagonal (nn)-matrix ...
Ikawati, Deasy Sandhya Elya +2 more
core
An Upper Bound on The Largest Signless Laplacian of an Odd Unicyclic Graph
, 2012 We derive an upper bound on the largest signless Laplacian eigenvalue of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained removing the edges of the unique cycle in the ...
Rojo, Oscar +2 more
core +1 more source
A relation between the Laplacian and signless Laplacian eigenvalues of a graph
, 2018 Let G be a graph of order n such that Sigma(n)(i)=0(-1) (i)a(i)gimel(n-i) and Sigma(n)(i=0)(-1)(i)b(i)gimel(n-i) are the characteristic polynomials of the signless Laplacian and the Laplacian matrices of G, respectively. We show that a(i) >= b(i) for i =
Akbari, S +3 more
core +1 more source
Spectra of the extended neighborhood corona and extended corona of two graphs
Electronic Journal of Graph Theory and Applications, 2016 In this paper we define extended corona and extended neighborhoodcorona of two graphs $G_{1}$ and $G_{2}$, which are denoted by$G_{1}\bullet G_{2}$ and $G_{1}\ast G_{2}$ respectively.
Chandrashekar Adiga +2 more
doaj +1 more source
Cospectral bipartite graphs for the normalized Laplacian [PDF]
, 2013 We present an infinite example of trees cospectral with respect to the normalized Laplacian and a use of the weighted normalized Laplacian to find cospectral pairs of unweighted bipartite graphs with respect to the normalized Laplacian.
Osborne, Steven, Steven Paul Osborne
core +1 more source
Spectral Results on Some Hamiltonian Properties of Graphs [PDF]
Romanian Journal of Mathematics and Computer Science, 2014 Using Lotker’s interlacing theorem on the Laplacian eigenvalues of a graph in [5] and Wang and Belardo’s interlacing theorem on the signless Laplacian eigenvalues of a graph in [6], we in this note obtain spectral conditions for some Hamiltonian ...
Rao Li
doaj