شماره ركورد كنفرانس :
3806
عنوان مقاله :
On the number of dominating sets of the Crown graphs
پديدآورندگان :
Jahari S s.jahari@gmail.com Department of Mathematics, Yazd University, 89195-741, Yazd, Iran , Alikhani S alikhani@yazd.ac.ir Department of Mathematics, Yazd University, 89195-741, Yazd, Iran
كليدواژه :
: Dominating set , global dominating set , independent dominating set , total dominating set , weakly connected dominating set.
عنوان كنفرانس :
دهمين كنفرانس ملي نظريه گراف و تركيبات جبري
چكيده فارسي :
Anon-empty subset S of vertices in a simple and finite graph G is a dominating set in G if every vertex inV (G)\S is adjacent to at least one vertex in S. There are about 75 different dominating sets in the literature and some of them are global dominating set, independent dominating set and total dominating set. In this paper we consider some types of dominating sets and count the number of theses dominating sets for the crown graph.
