THE MINIMUM ECCENTRIC-DOMINATING ENERGY OF A GRAPH
Keywords:
minimum eccentric-dominating set, minimum eccentric-dominating matrix, minimum eccentric-dominating eigenvaluesDOI:
https://doi.org/10.17654/0972087124020Abstract
Let $G$ be a simple graph. A subset $S$ of vertices in $G$ is said to be an eccentric-dominating set if for each vertex not in $S$, there exists at least one eccentric vertex in $S$ and $N[S]=G$. The cardinality of the minimum eccentric-dominating set is called the eccentric domination number, denoted by $\gamma_{e d}(G)$. In this article, we define and study the minimum eccentric-dominating energy $E_{e d}(G)$, and compute the exact value for some standard classes of graphs. Also, we establish some bounds for $E_{e d}(G)$.
Received: July 4, 2024
Revised: August 25, 2024
Accepted: September 28, 2024
References
C. Adiga, A. Bayad, I. Gutman and S. A. Srinivas, The minimum covering energy of a graph, Kragujevac J. Sci. 34 (2012), 39-56.
R. B. Bapat and S. Pati, Energy of a graph is never an odd integer, Bull. Kerala Math. Assoc. 1 (2011), 129-132.
J. A. Bondy and U. S. R. Murthy, Graph Theory with Applications, American Elsevier, New York, 1976.
I. Gutman, The energy of a graph, Ber. Math.-Statist. Sekt. Forsch. Graz 103 (1978), 1-22.
F. Harary, Graph Theory, Narosa Publications House, 2001.
V. R. Kulli, Theory of Domination in Graphs, Vishwa International Publications, 2010.
M. R. Rajesh Kanna, B. N. Dharmendra and G. Sridhara, The minimum covering energy of a graph, IJPAM 85(4) (2013), 707-718.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 PUSHPA PUBLISHING HOUSE, PRAYAGRAJ, INDIA

This work is licensed under a Creative Commons Attribution 4.0 International License.
_________________________
Attribution: Credit Pushpa Publishing House as the original publisher, including title and author(s) if applicable.
Non-Commercial Use: For non-commercial purposes only. No commercial activities without explicit permission.
Contact Puspha Publishing House for more info or permissions.





