论文信息 - γk(n) = max {⌊n/(2k+1)⌋, 1} for Maximal Outerplanar Graphs with n mod (2k+1) ≤ 6 - 字舞流文

γk(n) = max {⌊n/(2k+1)⌋, 1} for Maximal Outerplanar Graphs with n mod (2k+1) ≤ 6

[1] Hossam Ahmed Elgindy,et al. Hierarchical decomposition of polygons with applications , 1985 .

[2] C. N. Campos,et al. On dominating sets of maximal outerplanar graphs , 2013, Discret. Appl. Math..

[3] Sandra Mitchell Hedetniemi,et al. Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs , 1979, JACM.

[4] Robert E. Tarjan,et al. Dominating Sets in Planar Graphs , 1996, Eur. J. Comb..

[5] Lutz Volkmann,et al. Distance Domination and Distance Irredundance in Graphs , 2007, Electron. J. Comb..

[6] Jun-Ming Xu,et al. A note on distance domination numbers of graphs , 2009, Australas. J Comb..

[7] Inês Matos,et al. Distance domination, guarding and vertex cover for maximal outerplanar graph , 2013, ArXiv.

[8] Shin-ichi Tokunaga. Dominating sets of maximal outerplanar graphs , 2013, Discret. Appl. Math..