THE MINIMUM ECCENTRIC-DOMINATING ENERGY OF A GRAPH
Far East Journal of Mathematical Sciences (FJMS) · 2024
DOI: 10.17654/0972087124020 ↗Kurz gefasst
Fachartikel in der Zeitschrift Far East Journal of Mathematical Sciences (FJMS), 2024. Verfasst von A. Arun Kumar und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Let be a simple graph. A subset of vertices in is said to be an eccentric-dominating set if for each vertex not in , there exists at least one eccentric vertex in and . The cardinality of the minimum eccentric-dominating set is called the eccentric domination number, denoted by . In this article, we define and study the minimum eccentric-dominating energy , and compute the exact value for some standard classes of graphs. Also, we establish some bounds for .
Zitieren
APA
Kumar, A. A., Nandappa, D. S., & Nayaka, S. R. (2024). THE MINIMUM ECCENTRIC-DOMINATING ENERGY OF A GRAPH. Far East Journal of Mathematical Sciences (FJMS). https://doi.org/10.17654/0972087124020
Vancouver
Kumar AA, Nandappa DS, Nayaka SR. THE MINIMUM ECCENTRIC-DOMINATING ENERGY OF A GRAPH. Far East Journal of Mathematical Sciences (FJMS). 2024. doi:10.17654/0972087124020
BibTeX
@article{Kumar2024,
author = {Kumar, A. Arun and Nandappa, D. Soner and Nayaka, S. R.},
title = {THE MINIMUM ECCENTRIC-DOMINATING ENERGY OF A GRAPH},
journal = {Far East Journal of Mathematical Sciences (FJMS)},
year = {2024},
doi = {10.17654/0972087124020}
}
EUVIMED