Graphs with equal domination and independent domination number
MetadataShow full item record
CitationVaidya, 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.
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.
SourceTWMS Journal of Applied and Engineering Mathematics
The following license files are associated with this item:
Showing items related by title, author, creator and subject.
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 ...
Different views of hierarchy and why they matter: hierarchy as inequality or as cascading influence Cantimur, Yeliz; Bunderson, J. Stuart; Van Der Vegt, Gerben S.; Rink, Floor (Acad Management, 2016-08-01)Hierarchy is a reality of group life, for humans and for most other group-living species. However, there remains considerable debate about whether and when hierarchy can promote group performance and member satisfaction. ...
Etnik ve ulusal kimlikler ile dış grup tutumları ilişkisinde çatışma algısı ve dış gruba sorumluluk yükleme Bu araştırmada etnik ve ulusal kimliklerle özdeşim ile dış grup tutumları arasındaki ilişki, algılanan çatışma düzeyi ve dış gruba sorumluluk yükleme değişkenlerinin aracı rolü incelenerek değerlendirilmiştir. Sosyal kimlik ...