Domatically perfect graphs

AKCE International Journal of Graphs and Combinatorics

Naoki Matsumoto¹ 

[1] Department of Computer and Information Science, Faculty of Science and Technology, Seikei University;

关键词: domatically perfect;    domination number;    domatic number;    domatically full;    domatically complete;   

DOI  :  10.1016/j.akcej.2019.06.008

来源: DOAJ

【 摘 要 】

A graph of order is domatically perfect if , where and denote the domination number and the domatic number, respectively. In this paper, we give basic results for domatically perfect graphs, and study a main problem; for a given graph , to find a necessary and sufficient condition for and its complement to be both domatically perfect. Moreover, we investigate domatically complete graphs, which are domatically full and domatically perfect.

【 授权许可】

Unknown