Restrained double monophonic number of a graph
Ural mathematical journal, Tome 5 (2019) no. 2, pp. 55-63
Voir la notice de l'article provenant de la source Math-Net.Ru
For a connected graph $G$ of order at least two, a double monophonic set $S$ of a graph $G$ is a restrained double monophonic set if either $S=V$ or the subgraph induced by $V-S$ has no isolated vertices. The minimum cardinality of a restrained double monophonic set of $G$ is the restrained double monophonic number of $G$ and is denoted by $dm_{r}(G)$. The restrained double monophonic number of certain classes graphs are determined. It is shown that for any integers $a,\, b,\, c$ with $3 \leq a \leq b \leq c$, there is a connected graph $G$ with $m(G) = a$, $m_r(G) = b$ and $dm_{r}(G) = c$, where $m(G)$ is the monophonic number and $m_r(G)$ is the restrained monophonic number of a graph $G$.
Keywords:
Monophonic set, Restrained monophonic set, Restrained monophonic number, Restrained double monophonic set, Restrained double monophonic number.
@article{UMJ_2019_5_2_a4,
author = {A. P. Santhakumaran and K. Ganesamoorthy},
title = {Restrained double monophonic number of a graph},
journal = {Ural mathematical journal},
pages = {55--63},
publisher = {mathdoc},
volume = {5},
number = {2},
year = {2019},
language = {en},
url = {http://geodesic.mathdoc.fr/item/UMJ_2019_5_2_a4/}
}
A. P. Santhakumaran; K. Ganesamoorthy. Restrained double monophonic number of a graph. Ural mathematical journal, Tome 5 (2019) no. 2, pp. 55-63. http://geodesic.mathdoc.fr/item/UMJ_2019_5_2_a4/