On the eccentric spectra of the line graph of starlike trees

S. Balamoorthy; S.V. Bharanedhar; Yilun Shang; R. Gurusamy

doi:10.1155/ddns/9972973

On the eccentric spectra of the line graph of starlike trees

S. Balamoorthy, S.V. Bharanedhar, Yilun Shang^*, R. Gurusamy^*

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

2 Downloads (Pure)

Abstract

A tree is called starlike if it has exactly one vertex with a degree greater than two. In this paper, we determine the eccentricity spectrum of the line graphs of starlike trees and compute their eccentric energy. Furthermore, we establish that the eccentricity matrix of the line graph of any starlike tree is irreducible.

Original language	English
Article number	9972973
Pages (from-to)	1-16
Number of pages	16
Journal	Discrete Dynamics in Nature and Society
Volume	2025
Early online date	11 Nov 2025
DOIs	https://doi.org/10.1155/ddns/9972973
Publication status	Published - 11 Nov 2025

Keywords

Starlike tree
Line graph
Eccentricity matrix
Spectra of graphs

Access to Document

10.1155/ddns/9972973Licence: CC BY

eccentric_spectraAccepted author manuscript, 421 KBLicence: CC BY
Discrete Dynamics in Nature and Society - 2025 - Balamoorthy - On the Eccentric Spectra of the Line Graph of Starlike TreesFinal published version, 488 KBLicence: CC BY

Cite this

@article{d2a1bd7f753e4c5cad96fb119203cd61,

title = "On the eccentric spectra of the line graph of starlike trees",

abstract = "A tree is called starlike if it has exactly one vertex with a degree greater than two. In this paper, we determine the eccentricity spectrum of the line graphs of starlike trees and compute their eccentric energy. Furthermore, we establish that the eccentricity matrix of the line graph of any starlike tree is irreducible.",

keywords = "Starlike tree, Line graph, Eccentricity matrix, Spectra of graphs",

author = "S. Balamoorthy and S.V. Bharanedhar and Yilun Shang and R. Gurusamy",

year = "2025",

month = nov,

day = "11",

doi = "10.1155/ddns/9972973",

language = "English",

volume = "2025",

pages = "1--16",

journal = "Discrete Dynamics in Nature and Society",

issn = "1026-0226",

publisher = "Blackwell Publishing",

}

TY - JOUR

T1 - On the eccentric spectra of the line graph of starlike trees

AU - Balamoorthy, S.

AU - Bharanedhar, S.V.

AU - Shang, Yilun

AU - Gurusamy, R.

PY - 2025/11/11

Y1 - 2025/11/11

N2 - A tree is called starlike if it has exactly one vertex with a degree greater than two. In this paper, we determine the eccentricity spectrum of the line graphs of starlike trees and compute their eccentric energy. Furthermore, we establish that the eccentricity matrix of the line graph of any starlike tree is irreducible.

AB - A tree is called starlike if it has exactly one vertex with a degree greater than two. In this paper, we determine the eccentricity spectrum of the line graphs of starlike trees and compute their eccentric energy. Furthermore, we establish that the eccentricity matrix of the line graph of any starlike tree is irreducible.

KW - Starlike tree

KW - Line graph

KW - Eccentricity matrix

KW - Spectra of graphs

U2 - 10.1155/ddns/9972973

DO - 10.1155/ddns/9972973

M3 - Article

SN - 1026-0226

VL - 2025

SP - 1

EP - 16

JO - Discrete Dynamics in Nature and Society

JF - Discrete Dynamics in Nature and Society

M1 - 9972973

ER -