Relatively prime restrained detour domination number of a graph
Main Article Content
Abstract
Consider a connected graph G=(V, E) with a minimum of two vertices. A subset ⊆ 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 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.
Downloads
Download data is not yet available.
Article Details
How to Cite
C. Jayasekaran, & L G, B. (2024). Relatively prime restrained detour domination number of a graph. Gulf Journal of Mathematics, 16(2), 291-297. https://doi.org/10.56947/gjom.v16i2.1844
Section
Articles