Characterization of Upper Detour Monophonic Domination Number
This paper introduces the concept of \textit{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 maxi...
Sparad:
| Huvudupphov: | |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
Universidad de La Frontera
2020-12-01
|
| Serie: | Cubo |
| Ämnen: | |
| Länkar: | http://revistas.ufro.cl/ojs/index.php/cubo/article/view/2467/2024 |
| Taggar: |
Inga taggar, Lägg till första taggen!
|