Characterization of Upper Detour Monophonic Domination Number
Author
Abdul Khayyoom, M. Mohammed
Full text
http://revistas.ufro.cl/ojs/index.php/cubo/article/view/246710.4067/S0719-06462020000300315
Abstract
This paper introduces the concept of upper detour monophonic domination number of a graph. For a connected graph \( G \) with vertex set \( V(G) \), a set \( M\subseteq V(G) \) is called minimal detour monophonic dominating set, if no proper subset of \( M \) is a detour monophonic dominating set. The maximum cardinality among all minimal monophonic dominating sets is called upper detour monophonic domination number and is denoted by \( \gamma_{dm}^+(G) \). For any two positive integers \( p \) and \( q \) with \( 2 \leq p \leq q \) there is a connected graph \( G \) with \( \gamma_m (G) = \gamma_{dm}(G) = p \) and \( \gamma_{dm}^+(G)=q \). For any three positive integers \( p, q, r \) with \(2 < p < q < r\), there is a connected graph \( G \) with \( m(G) = p \), \( \gamma_{dm}(G) = q \) and \( \gamma_{dm}^+(G)= r \). Let \( p \) and \( q \) be two positive integers with \( 2 < p<q \) such that \( \gamma_{dm}(G) = p \) and \( \gamma_{dm}^+(G)= q \). Then there is a minimal DMD set whose cardinality lies between \( p \) and \( q \). Let \( p , q \) and \( r \) be any three positive integers with \( 2 \leq p \leq q \leq r\). Then, there exist a connected graph \( G \) such that \( \gamma_{dm}(G) = p , \gamma_{dm}^+(G)= q \) and \( \lvert V(G) \rvert = r\).
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
Upper double monophonic number of a graph.
Santhakumaran, A. P.; Venkata Raghu, T.. Proyecciones. Journal of Mathematics; Vol 37 No 2 (2018); 295-304 -
Edge-to-vertex m-detour monophonic number of a graph.
Santhakumaran, A. P.; Titus, P.; Ganesamoorthy, K.. Proyecciones. Journal of Mathematics; Vol 37 No 3 (2018); 415-428 -
Upper Edge Detour Monophonic Number of a Graph
Titus, P.; Ganesamoorthy, K.. Proyecciones. Journal of Mathematics; Vol 33 No 2 (2014); 175-187