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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
New York Business Global
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |