The dominating set of the graph G is a subset D of vertex set V, such that every vertex not in V - D is adjacent to at least one vertex in the vertex subset D. A dominating set D is a minimal dominating set if no proper subset of D is a dominating set. The number of elements in such set is called as domination number of graph and is denoted by gamma(G). In this work the domination numbers are obtained for family of prism graphs such as prism CLn, antiprism Q(n) and crossed prism R-n by identifying one of their minimum dominating set.
机构:
Henan Normal Univ, Coll Math & Informat Sci, Xinxiang 453007, Peoples R ChinaHenan Normal Univ, Coll Math & Informat Sci, Xinxiang 453007, Peoples R China
Li, Hengzhe
论文数: 引用数:
h-index:
机构:
Wu, Baoyindureng
Yang, Weihua
论文数: 0引用数: 0
h-index: 0
机构:
Taiyuan Univ Technol, Sch Math Sci, Taiyuan 030024, Shanxi, Peoples R ChinaHenan Normal Univ, Coll Math & Informat Sci, Xinxiang 453007, Peoples R China
机构:
Research and Development Centre, Bharathiar University, CoimbatoreResearch and Development Centre, Bharathiar University, Coimbatore
Jagadeesh R.
Kanna M.R.R.
论文数: 0引用数: 0
h-index: 0
机构:
Research and Development Centre, Bharathiar University, CoimbatoreResearch and Development Centre, Bharathiar University, Coimbatore
Kanna M.R.R.
Mamta D.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Mathematics, National Institute of Engineering, MysuruResearch and Development Centre, Bharathiar University, Coimbatore
Mamta D.
Kumar R.P.
论文数: 0引用数: 0
h-index: 0
机构:
Research and Development Centre, Bharathiar University, Coimbatore
Post Graduate Department of Mathematics, Maharani's Science College for Women, J. L. B. Road, MysuruResearch and Development Centre, Bharathiar University, Coimbatore