论文信息 - Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups - 字舞流文

Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups

Abstract In this paper, we characterize cubic and quartic Cayley graphs on abelian groups that admit an efficient dominating set, and then we give domination numbers, even when they do not have an efficient dominating set, when it is possible.

Cafer Çaliskan | Stefko Miklavic | Sibel Ozkan

[1] Dánuţ Marcu. A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH , 1985 .

[2] Jaeun Lee,et al. Independent perfect domination sets in Cayley graphs , 2001 .

[3] John B. Fraleigh. A first course in abstract algebra , 1967 .

[4] Joseph G. Peters,et al. Efficient domination in circulant graphs with two chord lengths , 2007, Inf. Process. Lett..

[5] N. Biggs. Algebraic Graph Theory , 1974 .

[6] Patric R. J. Östergård,et al. On the domination number of 2-dimensional torus graphs , 2018 .

[7] Norbert Seifter,et al. Dominating Cartesian Products of Cycles , 1995, Discret. Appl. Math..

[8] Michel Mollard. On perfect codes in Cartesian products of graphs , 2011, Eur. J. Comb..

[10] Italo J. Dejter,et al. Efficient dominating sets in Cayley graphs , 2003, Discret. Appl. Math..