Let W n be a linear pentagonal chain with 2 n pentagons. In this article, according to the
decomposition theorem for the normalized Laplacian polynomial of W n, we obtain that the …

ENERGIES OF GRAPHS SURVEY, CENSUS, BIBLIOGRAPHY Ivan Gutman & Boris Furtula
Page 1 ENERGIES OF GRAPHS SURVEY, CENSUS, BIBLIOGRAPHY Ivan Gutman & Boris …

Let G be a connected graph of order n. Let di be the degree of the vertex vi in G. The Randic
matrix R= R (G)=(bij) n× n is defined by bij= 1/√ di dj if the vertices vi and vj are adjacent …

The spectrum of the normalized Laplacian matrix of a graph provides many structural
information of the graph, and it has many applications in numerous areas and in different …

A novel distance function named resistance distance was introduced on the basis of
electrical network theory. The resistance distance between any two vertices u and v in graph …

Abstract Let G=(V, E) be a simple graph of order n with normalized Laplacian eigenvalues ρ
1≥ ρ 2≥⋯≥ ρ n− 1≥ ρ n= 0. The normalized Laplacian spread of graph G, denoted by ρ …

Abstract Let $ G=(V,\, E) $ be a simple graph of order $ n $ and the normalized Laplacian
eigenvalues $\rho_1\geq\rho_2\geq\cdots\geq\rho_ {n-1}\geq\rho_n= 0$. The normalized …

Let G be a simple graph of order n with normalized Laplacian eigenvalues ρ 1≥ ρ 2≥⋯≥ ρ
n− 1≥ ρ n= 0. Let m G (ρ i)(1≤ i≤ n) be the multiplicity of the normalized Laplacian …

The normalized algebraic connectivity of a graph with order n, denoted by ρ n− 1, is the
second smallest eigenvalue of the normalized Laplacian matrix of the graph. In this paper …

Abstract Let G=(V, E) be a simple graph of order n. The normalized Laplacian eigenvalues of
graph G are denoted by ρ 1 (G)≥ ρ 2 (G)≥⋯≥ ρ n− 1 (G)≥ ρ n (G)= 0. Also let G and G …