Back to Search
Start Over
Some remarks on the sum of the inverse values of the normalized signless Laplacian eigenvalues of graphs.
- Source :
-
Communications in Combinatorics & Optimization . 2021, Vol. 6 Issue 2, p259-271. 13p. - Publication Year :
- 2021
-
Abstract
- Let G = (V;E), V = fv1; v2;:::; vng, be a simple connected graph with n vertices, m edges and a sequence of vertex degrees d1 d2 dn > 0, di = d(vi). Let A = (aij)nn and D = diag(d1; d2;:::; dn) be the adjacency and the diagonal degree matrix of G, respectively. Denote by L+(G) = D-1=2(D + A)D-1=2 the normalized signless Laplacian matrix of graph G. The eigenvalues of matrix L+(G), 2 = + 1 + 2 = + n = 0, are normalized signless Laplacian eigenvalues of G. In this paper some bounds for the sum K+(G) = Pn i=1 1 + i are considered. [ABSTRACT FROM AUTHOR]
- Subjects :
- *EIGENVALUES
*GRAPH theory
*GRAPH connectivity
*GEOMETRIC vertices
*EDGES (Geometry)
Subjects
Details
- Language :
- English
- ISSN :
- 25382128
- Volume :
- 6
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Communications in Combinatorics & Optimization
- Publication Type :
- Academic Journal
- Accession number :
- 154785167
- Full Text :
- https://doi.org/10.22049/CCO.2021.26987.1173