The Minimum Superior Eccentric Dominating Energy of Graphs

R. Tejaskumar *

Department of Mathematics, Jamal Mohamed College (Autonomous) (Affiliated to Bharathidasan University), Tiruchirappalli-620020, Tamil Nadu, India.

A. Mohamed Ismayil

Department of Mathematics, Jamal Mohamed College (Autonomous) (Affiliated to Bharathidasan University), Tiruchirappalli-620020, Tamil Nadu, India.

*Author to whom correspondence should be addressed.


Abstract

For a graph  G = (V, E) of order K2 the minimum superior eccentric dominating energy SEed(G) is the sum of the eigen values obtained from the minimum superior eccentric dominating K x K matrix Ased (G) = (Seij) In this paper SEed(G) of standard graphs are computed. Properties, upper and lower bounds for SEed(G) are established.

Keywords: Superior eccentricity, superior eccentric vertex, minimum superior eccentric dominating set, superior eccentric dominating eigen values, minimum superior eccentric dominating energy


How to Cite

Tejaskumar , R., and A. Mohamed Ismayil. 2023. “The Minimum Superior Eccentric Dominating Energy of Graphs”. Asian Research Journal of Mathematics 19 (9):233-41. https://doi.org/10.9734/arjom/2023/v19i9715.

Downloads

Download data is not yet available.