Computing Double Domination Number of Double Graph of Some Regular Graphs
Boletim da Sociedade Paranaense de Matemática · 01.11.2025 · 43 (3)
DOI: 10.5269/bspm.78558 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 01.11.2025. Verfasst von Udhayashree R. und 1 weiteren Autor:innen. Die Arbeit nennt 11 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
R., U., & R., R. (2025). Computing Double Domination Number of Double Graph of Some Regular Graphs. Boletim da Sociedade Paranaense de Matemática, 43(3). https://doi.org/10.5269/bspm.78558
Vancouver
R. U, R. R. Computing Double Domination Number of Double Graph of Some Regular Graphs. Boletim da Sociedade Paranaense de Matemática. 2025;43(3). doi:10.5269/bspm.78558
BibTeX
@article{R2025,
author = {R., Udhayashree and R., Rajeswari},
title = {Computing Double Domination Number of Double Graph of Some Regular Graphs},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2025},
volume = {43},
number = {3},
doi = {10.5269/bspm.78558}
}
EUVIMED