COMPUTING DOUBLE DOMINATION NUMBER OF DOUBLE GRAPH OF SOME REGULAR GRAPHS
Abstract
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.
Downloads
Copyright (c) 2025 Boletim da Sociedade Paranaense de Matemática
This work is licensed under a Creative Commons Attribution 4.0 International License.
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).
