The Minimum Superior Eccentric Dominating Energy of Graphs
R. Tejaskumar, A. Mohamed Ismayil
Asian Research Journal of Mathematics · pp. 233–241 · Published 21 Jul 2023
10.9734/arjom/2023/v19i9715Abstract
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.
Cited by 2
2 citations reported by external sources — individual citing-article records aren't available to list yet.
Article metrics
Real usage data collected on this platform.
25
Page views
0
PDF downloads
3
Outbound clicks
2
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.