Graphs with equal domination and independent domination numbers
Purnima Gupta, Rajesh Singh, S. Arumugam
AKCE International Journal of Graphs and Combinatorics · 2020
doi:10.1080/09728600.2020.1833692 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Let γ(G) and i(G) denote the domination number and independent domination number of a graph G. In this article, we establish a sufficient condition for a graph G to satisfy which yields some of the well known classical theorems as corollaries. Further, we also construct several families of graphs G satisfying γ(G) = i(G) using the sufficient condition.
Abstract licence: CC BY-NC
References10
10 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.