Hilal A. Ganie

TL;DR: In this article, a lower bound for the Laplacian energy of a simple graph with n vertices, m edges, maximum degree Δ, average degree d = 2 m n, clique number ω has been obtained.

TL;DR: For a simple graph G with n-vertices, m edges and having Laplacian eigenvalues μ 1, μ 2, etc., μ n − 1, μ n = 0, let S k (G ) = ∑ i = 1 k μ i, be the sum of k largest LaplACian eigens of G as mentioned in this paper.

TL;DR: For a simple graph G of order n, size m and with signless Laplacian eigenvalues q 1, q 2, q 3, q 4, q 5, q 6, q 7, q 8, q 9, q 10, q 11, q 12, q 13, q 14, q 15, q 16, q 17, q 18, q 19, q 20, q 21, q 22, q 23, q 24, q 25, q 26, q 27, q 28, q 29, q 30, q 31,

TL;DR: In this article, the generalized distance matrix of a simple connected graph G is defined as a convex combination of the convex combinations of T r (G ) + (1 − α ) D (G) for 0 ≤ α ≤ 1.

TL;DR: In this article, the energy and Laplacian energy of the k-th iterated extended double cover of a bipartite graph G and a double graph D(G) were studied.