We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
RELATIVELY PRIME RESTRAINED DETOUR DOMINATION NUMBER OF A GRAPH.
- Authors
JAYASEKARAN, C.; BINOJA, L. G.
- Abstract
Consider a connected graph G = (V, E) with a minimum of two vertices. A subset S ⊆ V is termed a relatively prime restrained detour dominating set of G if it fulfills two conditions: firstly, S must be a relatively prime detour dominating set, and secondly, the induced subgraph < V - S > should not contain any isolated vertices. The relatively prime restrained detour domination number, denoted as γrprdn (G), is defined as the minimum cardinality of such a set that satisfies these conditions. Precise values for certain standard graphs, limits and some interesting results are established.
- Subjects
DOMINATING set; GRAPH connectivity; PRIME numbers
- Publication
Gulf Journal of Mathematics, 2024, Vol 16, Issue 2, p291
- ISSN
2309-4966
- Publication type
Article
- DOI
10.56947/gjom.v16i2.1844