Independent 2-Domination in the Corona of Graphs
Abstract
Given a nontrivial graph, a set of vertices of a graph is an independent set if every pair of distinct vertices are not adjacent and it is a 2-dominating set if each vertex in its complement is adjacent to at least two vertices in the set. A set of vertices of a graph is an independent 2-dominating set if it is both an independent set and a 2-dominating set. The independent 2-domination number of a nontrivial graph is the cardinality of a minimum independent 2-dominating set. In this paper, we characterize the independent 2-dominating sets in the vertex and edge corona of graphs and derive their independent 2-domination numbers.
Fields of Study & Subjects
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Graph theory and applications
Publication details
- Journal / source
- International Journal of Innovative Research in Multidisciplinary Education
- Volume
- 05
- Issue
- 02
- Publication date
- 23 February 2026
- Language
- EN