.

ISSN 2063-5346
For urgent queries please contact : +918130348310

The Outer Connected Detour Monophonic Domination Number of a Graph

Main Article Content

N.E. Johnwin Beaula,S. Joseph Robin
» doi: 10.48047/ecb/2023.12.si7.137

Abstract

If M⊆V is both an outer connected detour monophonic set and a dominating set of G, it is referred to as an outer connected detour monophonic dominating set of G. The outer connected detour monophonic domination number of G, which is represented by the symbol〖 γ〗_ocdm (G) is the minimum cardinality of an outer connected detour monophonic dominating set of G. The outer connected detour monophonic dominating number of G for some standard graphs is determined.

Article Details