Year: 2025
Type: article
Abstract: A dominating set D in a graph Γ is a subset of its vertex set such that every vertex of Γ either belongs to D or is adjacent to at least one vertex of D. A dominating set D in a graph Γ with vertex set V is said to be a co-odd dominating set if the degree of every vertex belonging to V \D is odd.A co-odd dominating set is minimum if it contains the least possible vertices.The size of a minimum co-odd dominating set in a graph Γ is called the co-odd domination number of Γ .In this paper, we establish some fundamental properties and bounds of the co-odd domination number.We also determine the co-odd domination numbers of several well-known graphs and their complements.
Source: Contributions to Mathematics
DOI: 10.47443/cm.2025.021
Authors: Jayjit Barman, Shibsankar Das
Institution: Banaras Hindu University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4411277528