Results on Relatively Prime Domination Number of Vertex Switching of Some Graphs

If a set S ⊆ V has at least two members and every pair of vertices u and v is such that (d(u), d(v)) = 1, then it is said to be a relatively prime dominating set. The relatively prime domination number, represented by γrpd(G), is the lowest cardinality of a relatively prime dominating set. The switc...

Full description

Bibliographic Details
Main Authors: A Jancy Vini, C Jayasekaran
Format: Article
Language:English
Published: Accademia Piceno Aprutina dei Velati 2023-12-01
Series:Ratio Mathematica
Subjects:
Online Access:http://eiris.it/ojs/index.php/ratiomathematica/article/view/1211