Graphs that are simultaneously efficient open domination and efficient closed domination graphs

详细信息    查看全文

• 作者：Sandi Klavžar^a ; ^b ; ^c ; ^{sandi.klavzar@fmf.uni-lj.si} ; Iztok Peterin^c ; ^d ; ^{iztok.peterin@um.si} ; Ismael G. Yero^e ; ^{ismael.gonzalez@uca.es}
• 关键词：Efficient open domination ; Efficient closed domination ; Perfect code ; Computational complexity ; Tree ; Sierpiński graph
• 刊名：Discrete Applied Mathematics
• 出版年：2017
• 出版时间：30 January 2017
• 年：2017
• 卷：217
• 期：part_P3
• 页码：613-621
• 全文大小：462 K
• 卷排序：217

文摘

A graph is an efficient open (resp. closed) domination graph if there exists a subset of vertices whose open (resp. closed) neighborhoods partition its vertex set. Graphs that are efficient open as well as efficient closed (shortly EOCD graphs) are investigated. The structure of EOCD graphs with respect to their efficient open and efficient closed dominating sets is explained. It is shown that the decision problem regarding whether a graph is an EOCD graph is an NP-complete problem. A recursive description that constructs all EOCD trees is given and EOCD graphs are characterized among the Sierpiński graphs.