Monophonic Eccentric Domination Numbers of Graphs

Authors

  • Anabel E. Gamorez Western Mindanao State University
  • Sergio R. Canoy Jr. Mindanao State University-Iligan Institute of Technology

DOI:

https://doi.org/10.29020/nybg.ejpam.v15i2.4354

Keywords:

monophonic, eccentric, domination, join, corona, lexicographic product

Abstract

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.

Downloads

Published

2022-04-30

Issue

Vol. 15 No. 2: (April 2022)

Section

Topology

License

Copyright (c) 2022 European Journal of Pure and Applied Mathematics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.

By agreeing to this statement, you acknowledge that:

  • You retain full copyright over your work.
  • The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
  • This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.

How to Cite

Monophonic Eccentric Domination Numbers of Graphs. (2022). European Journal of Pure and Applied Mathematics, 15(2), 635-645. https://doi.org/10.29020/nybg.ejpam.v15i2.4354