Abstract
A set S ⊆ V is said to be a dominating set in a graph G if every vertex in V – S is adjacent to some vertex in S and the domination number of G is defined to be the minimum cardinality of a dominating set in G. A dominating set D is said to be an eccentric dominating set if for every v ∈ V–D, there exists at least one eccentric vertex of v in D. An eccentric dominating set D is a minimal eccentric dominating set if no proper subset S ⊂ D is an eccentric dominating set. In this paper, we introduce a new parameter known as upper eccentric domination number. The upper eccentric domination number ⎾ed(G) of a graph G equals the maximum cardinality of a minimal eccentric dominating set, that is ⎾ed(G) = max |D|, where the maximum is taken over D in D’, where D’ is the set of all minimal eccentric dominating sets of G.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.