The Detour Domination and Connected Detour Domination values of a graph

Autor:	R.V Revathi, M Antony
Jazyk:	angličtina
Rok vydání:	2022
Předmět:	domination number detour number detour domination value connected detour domination value etc. Mathematics QA1-939 Probabilities. Mathematical statistics QA273-280
Zdroj:	Ratio Mathematica, Vol 44, Iss 0, Pp 205-212 (2022)
Druh dokumentu:	article
ISSN:	1592-7415 2282-8214
DOI:	10.23755/rm.v44i0.908
Popis:	The number of -sets that belongs to in G is defined as the detour domination value of indicated by for each vertex . In this article, we examined at the concept of a graph’s detour domination value. The connected detour domination values of a vertex represented as , are defined as the number of -sets to which a vertex belongs to G. Some of the related detour dominating values in graphs’ general characteristics are examined. This concept’s satisfaction of some general properties is investigated. Some common graphs are established.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/520becaf70f64c7f80822ab55cba9194 Zobrazit plný text záznamu View record in DOAJ