Eccentricity Laplacian energy of a graph

A. Harshitha, S. Nayak, S. D’Souza*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

Let G be a simple, finite, undirected and connected graph. The eccentricity of a vertex v is the maximum distance from v to all other vertices of G. The eccentricity Laplacian matrix of G with n vertices is a square matrix of order n, whose elements are elij, where elij is −1 if the corresponding vertices are adjacent, elii is the eccentricity of vi for 1 ≤ i ≤ n, and elij is 0 otherwise. If ɛ1, ɛ2, …, ɛn are the eigenvalues of the n∑ eccentricity Laplacian matrix, then the eccentricity Laplacian energy of G is ELE(G) = |ɛi − avec(G)|, where avec(G) is the average eccentricities of all the vertices of G. In this study, some properties of the eccentricity Laplacian energy are obtained and comparison between thge eccentricity Laplacian energy and the total π−electron energy is obtained. i=1.

Original languageEnglish
Pages (from-to)567-575
Number of pages9
JournalNanosystems: Physics, Chemistry, Mathematics
Volume15
Issue number5
DOIs
Publication statusPublished - 10-2024

All Science Journal Classification (ASJC) codes

  • Mathematics (miscellaneous)
  • Materials Science (miscellaneous)
  • Condensed Matter Physics
  • Physics and Astronomy (miscellaneous)

Fingerprint

Dive into the research topics of 'Eccentricity Laplacian energy of a graph'. Together they form a unique fingerprint.

Cite this