COMPUTING DOUBLE DOMINATION NUMBER OF DOUBLE GRAPH OF SOME  REGULAR GRAPHS

Udhayashree R; Rajeswari R

doi:10.5269/bspm.78558

COMPUTING DOUBLE DOMINATION NUMBER OF DOUBLE GRAPH OF SOME REGULAR GRAPHS

Auteurs-es

Udhayashree R Department of mathematics, sathyabama institute of science and technology https://orcid.org/0009-0008-8571-9730
Rajeswari R Department of Mathematics, Sathyabama Institute of science and technology

DOI :

https://doi.org/10.5269/bspm.78558

Résumé

A graph in which every vertex has the same valency or degree is known as a regular graph.
The double graph D(G) of a regular graph is constructed by duplicating each vertex and connecting the
corresponding duplicates iff the original vertices are adjacent. This process creates a motivating and composite
graph structure, raising questions about the domination properties of D(G). In this paper we focus on the
double domination of double graph of some regular graphs which is constructed using an algorithm (Llama
New, 2016). The double domination number of regular graphs on even and odd order are determined.