Graphs with equal domination and independent domination number
Citation
Vaidya, S. K. & Pandit, R. M. (2015). Graphs with equal domination and independent domination number. TWMS Journal of Applied and Engineering Mathematics, 5(1), 74-79.Abstract
A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the minimum cardinality of an independent dominating set of G. In this paper, some new classes of graphs with equal domination and independent domination numbers are presented and exact values of their domination and independent domination numbers are determined.
Volume
5Issue
1URI
https://hdl.handle.net/11729/2550http://jaem.isikun.edu.tr/web/index.php/archive/89-vol5no1/199
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
Total roman domination number of graphs
Thakkar, Dineshbhai; Badiyani, Sanket (Işık University Press, 2022)In this paper a characterization of minimal total roman dominating functions has been proved. It has also been proved that if v is a pendant vertex and its neighbor u is not a pendant vertex then f(v) = 0 or 1 for any ... -
Secure point set domination in graphs
Gupta, Purnima; Goyal, Alka (Işık University Press, 2024-04)In this paper, we introduce the notion of secure point-set domination in graphs. A point-set dominating D of graph G is called a secure point-set dominating set if for every vertex u ? V ?D, there exists a vertex v ? D?N(u) ... -
On total vertex-edge domination
Şahin, Bünyamin; Şahin, Abdulgani (Işık University Press, 2019)In this paper we obtain an improved upper bound of total vertex edgedomination number of a tree. If T is a connected tree with order n, then ????(T) ? m/3 with m = 6[ n/6] and we characterize the trees attaining this upper ...