文章基本信息

标题：NEIGHBOURHOOD CONNECTED DOMINATION IN CENTRAL GRAPHS
本地全文：下载
作者：VIJAYALAKSMI RAVIRAJAN ; M. BABU ; M. RAVITHAMMAL 等
期刊名称：International Journal of Early Childhood Special Education
电子版ISSN：1308-5581
出版年度：2022
卷号：14
期号：5
页码：4959-4960
DOI：10.9756/INTJECSE/V14I5.601
语种：English
出版社：International Journal of Early Childhood Special Education
摘要：Let G = (V,E) be a connected graph. A dominating set S of G is called a neighbourhood connected dominating set (ncd-set) if the induced subgraphis connected. The minimum cardinality of ancd-set of G is called the neighbourhood connected domination number of G and is denoted by ????????(??).In this paper, we analyse this parameter for central graph of various standard graphs.
关键词：Central graph;Neighbourhood connected domination;domination