References
- HaynesT.W., HedetniemiS.T., SlaterP.J., Fundamentals of Domination in Graphs 1998Marcel Dekker New York
- HaynesT.W., HedetniemiS.T., SlaterP.J., Domination in Graphs: Advanced Topics 1998Marcel Dekker New York
- HenningM.A., RallD.F., On graphs with disjoint dominating and 2-dominating sets, Discuss. Math. Graph Theory, 33 2013 139–146
- DiestelR., Graph Theory 2012Springer Heidelberg
- KikunoT., YoshidaN., KakudaY., The NP-completeness of the dominating set problem in cubic planar graphs, IEICE Trans., E63 1980 443–444
- J. Suomela, Is the dominating set problem restricted to planar bipartite graphs of maximum degree 3 NP-complete? (Posted by Florent Foucaud) Theoretical Computer Science Stack Exchange:http://cstheory.stackexchange.com/questions/2505 [2016-01-08].
- FinkJ.F., JacobsonM.S., KinchL.F., RobertsJ., On graphs having domination number half their order, Period. Math. Hungar., 16 1985 287–293
- ToppJ., VestergaardP.D., Well irredundant graphs, Discrete Appl. Math., 63 1995 267–276
- BalbuenaC., HansbergA., HaynesT.W., HenningM.A., Total domination edge critical graphs with total domination number three and many dominating pairs, Graphs Combin., 31 2015 1163–1176
- BurgerA.P., de VilliersA.P., van VuurenJ.H., Edge stability in secure graph domination, Discrete Math. Theor. Comput. Sci., 17 2015 103–122
- ChenX.-G., FujitaS., FuruyaM., SohnM.Y., Constructing connected bicritical graphs with edge-connectivity 2, Discrete Appl. Math., 160 2012 488–493
- EdwardsM., MacGillivrayG., The diameter of total domination and independent domination vertex-critical graphs, Australas. J. Combin., 52 2012 33–39
- NordhausE.A., GaddumJ., On complementary graphs, Amer. Math. Monthly, 63 1956 175–177
- AouchicheM., HansenP., A survey of Nordhaus-Gaddum type relations, Discrete Appl. Math., 161 2013 466–546
- BorowieckiM., On the external stability number of a graph and its complement, Prace Nauk. Inst. Mat. Politech. Wrocaw., 12 1976 39–43
- CockayneE.J., HedetniemiS.T., Toward a theory of domination in graphs, Networks, 7 1977 247–261
- JaegarF., PayanC., Relations du type Nordhaus-Gaddum pour le nombre d’absorption d’un graphe simple, C. R. Acad. Sci. Paris A, 274 1972 728–730
- LaskarR., PetersK., Vertex and edge domination parameters in graphs, Congr. Numer., 48 1985 291–305
- DunbarJ.E., HaynesT.W., HedetniemiS.T., Nordhaus-Gaddum bounds for domination sums in graphs with specified minimum degree, Util. Math., 67 2005 97–105
- JosephJ.P., ArumugamS., Domination in graphs, Int. J. Manage. Syst., 11 1995 177–182
- BrighamR.C., ChinnP.Z., DuttonR.D., Vertex domination-critical graphs, Networks, 18 1988 173–179
- FulmanJ., HansonD., MacGillivrayG., Vertex domination-critical graphs, Networks, 25 1995 41–43
- ManimuthuY., KumarasamyK., Domination Stable Graphs 2012Lambert Academic Publishing Saarbrücken
- CymanJ., Total outer-connected domination in trees, Discuss. Math. Graph Theory, 30 2010 377–383
- HouX., A characterization of (2γ,γp)-trees, Discrete Math., 308 2008 3420–3426
- LuY., HouX., XuJ.-M., LiN., A characterization of (γt,γ2)-trees, Discuss. Math. Graph Theory, 30 2010 425–435