Monophonic Eccentric Domination Numbers of Graphs
Keywords:monophonic, eccentric, domination, join, corona, lexicographic product
Let G be a (simple) undirected graph with vertex and edge sets V (G) and E(G), respectively. A set S ⊆ V (G) is a monophonic eccentric dominating set if every vertex in V (G) \ S has a monophonic eccentric vertex in S. The minimum size of a monophonic eccentric dominating set in G is called the monophonic eccentric domination number of G. It is shown that the absolute difference of the domination number and monophonic eccentric domination number of a graph can be made arbitrarily large. We characterize the monophonic eccentric dominating sets in graphs resulting from the join, corona, and lexicographic product of two graphs and determine bounds on their monophonic eccentric domination numbers.
How to Cite
Copyright (c) 2022 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyrihgt Holder.
If necessary, authors are responsible for obtaining permissions to reprint previously published figures, tables, and other material.