we prove that outerplanar graphs with diameter two and three have bounded paired domination number. This implies that the paired domination number of such graphs can be determined in polynomial time. Furthermore
we characterize all outerplanar graphs with diameter two. On the other hand
we also give examples of outerplanar graphs of diameter at least four
having arbitrarily large paired domination numbers.
关键词
Keywords
references
Haynes T W,Hedetniemi S T,Slater P J.Domination in Graphs:Advanced Topics[M].New York:Marcel Dekker,Inc,1998.
Haynes T W,Hedetniemi S T,Slater P J.Fundamentals of Domination in Graphs[M].New York:Marcel Dekker,Inc,1998.
Haynes T W,Slater P J.Paired-domination in graphs[J].Networks,1998,32:199-206.
Alvarado J D,Dantas S,Rautenbach D.Perfectly relating the domination,total domination,and paired domination numbers of a graph[J].Discrete Math,2015,338:1424-1431.
Dorbec P,Hartnell B,Henning M A.Paired versus double domination in K1,r-free graphs[J].J Comb Optim,2014,27:688-694.
Henning M A,Mc Coy J,Southey J.Graphs with maximum size and given paired-domination number[J].Discrete Appl Math,2014,170:72-82.
West D B.Introduction to Graph Theory,2nd[M].Beijing:Pearson Education,2004.