Monophonic Eccentric Domination Numbers of Graphs

Monophonic Eccentric Domination Numbers of Graphs

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 monop...

Full description

Bibliographic Details
Main Authors: Canoy, S.R., Jr (Author), Gamorez, A.E (Author)
Format: Article
Language:English
Published: New York Business Global 2022
Subjects:
corona
domination
eccentric
join
lexicographic product
Monophonic
Online Access:View Fulltext in Publisher
Description
Summary: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 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. © 2022 EJPAM All rights reserved.
ISBN:13075543 (ISSN)
DOI:10.29020/nybg.ejpam.v15i2.4354

Similar Items