Dataset 𝑆 ( 𝐺 ) : Subdivision of Graph 𝐺

Published: 8 July 2024| Version 1 | DOI: 10.17632/47k4gprcwy.1
Ernesto Parra Inza,


An important subject of study, which has experienced significant development in recent years, involves exploring graph-theoretic parameters through the use of graph operators. In 1943, J. Krausz introduced the concept of graph operators through his work on line graphs. Since then, different kinds of graph operators have been defined and investigated in the studies of graph dynamics, topological indices, and total domination. Motivated by this, we provide this dataset, which contains a set of graphs 𝐺=(𝑉,𝐸) generated randomly and their subdivision operator. The subdivision of a graph 𝐺, denoted by 𝑆(𝐺), is the graph obtained from 𝐺 by replacing each of its edges with a path of length two. Additionally, we provide the double total domination number of 𝐺 and 𝑆(𝐺), as well as the C++ code used to generate the dataset and calculate the double total domination number using the CPLEX solver in C++.



Universidad Autonoma de Guerrero - Campus Acapulco, Universidad Autonoma del Estado de Morelos


Graph Theory, Graph Algorithm, Integer Programming