Forcing total outer connected monophonic number of a graph

Autor: Ganesamoorthy, Kathiresan, Lakshmi Priya, Shanmugam

Publikováno v: Известия Саратовского университета. Новая серия. Серия Математика. Механика. Информатика, Vol 22, Iss 3, Pp 278-286 (2022)

For a connected graph $G = (V,E)$ of order at least two, a subset $T$ of a minimum total outer connected monophonic set $S$ of $G$ is a forcing total outer connected monophonic subset for $S$ if $S$ is the unique minimum total outer connected monopho

Externí odkaz: https://doaj.org/article/e73fc48eb41640499222129e5084901c