Open AccessBounds of Laplacian Energy of a Hypercube Graph
Author(s) -
K. Ameenal Bibi,
B. Vijayalakshmi,
R. Jothilakshmi
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.10.21287
Subject(s) - laplacian matrix , combinatorics , adjacency matrix , hypercube , mathematics , laplace operator , diagonal , eigenvalues and eigenvectors , algebraic connectivity , diagonal matrix , adjacency list , graph , matrix (chemical analysis) , discrete mathematics , physics , mathematical analysis , quantum mechanics , geometry , chemistry , chromatography
Let Qn denote the n – dimensional hypercube with order 2n and size n2n-1. The Laplacian L is defined by L = D where D is the degree matrix and A is the adjacency matrix with zero diagonal entries. The Laplacian is a symmetric positive semidefinite. Let µ1 ≥ µ2 ≥ ....µn-1 ≥ µn = 0 be the eigen values of the Laplacian matrix. The Laplacian energy is defined as LE(G) = . In this paper, we defined Laplacian energy of a Hypercube graph and also attained the lower bounds.