Connected cototal domination number of a graph
عنوان مقاله: Connected cototal domination number of a graph
شناسه ملی مقاله: JR_COMB-1-2_002
منتشر شده در در سال 1391
شناسه ملی مقاله: JR_COMB-1-2_002
منتشر شده در در سال 1391
مشخصات نویسندگان مقاله:
B. Basavanagoud - Karnatak University
Sunilkumar Hosamani - Karnatak University, Dharwad
خلاصه مقاله:
B. Basavanagoud - Karnatak University
Sunilkumar Hosamani - Karnatak University, Dharwad
A dominating set D \subseteq V of a graph G = (V,E) is said to be a connected cototal dominating set if \langle D \rangle is connected and \langle V-D \rangle \neq \varnothing , contains no isolated vertices. A connected cototal dominating set is said to be minimal if no proper subset of D is connected cototal dominating set. The connected cototal domination number \gamma_{ccl}(G) of G is the minimum cardinality of a minimal connected cototal dominating set of G. In this paper, we begin an investigation of connected cototal domination number and obtain some interesting results.
کلمات کلیدی: Domination Number, connected domination number, cototal domination number and connected cototal domination number
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1319360/