New results on connected dominating structures in graphs

[1] R. E. Atani, A. H. Karbasi, Application of dominating sets in wireless sensor networks, International Journal of Security and Its Applications7 (2013) 185–202. ⇒53Search in Google Scholar

[2] S. Balamurugan, I. Sahul Hamid, Isolate domination in graphs, Arab Journal of Mathematical Sciences22 (2016) 232–241. ⇒5310.1016/j.ajmsc.2015.10.001Search in Google Scholar

[3] C. Berge, The Theory of Graphs, Dover Publications 2001. ⇒53Search in Google Scholar

[4] S. R. Canoy, T. V. Daniel, Clique domination in a graph, Applied Mathematical Sciences9 116 (2015) 5749–5755. ⇒53, 5710.12988/ams.2015.54300Search in Google Scholar

[5] M. B. Cozzens, L. L. Kelleher, Dominating cliques in graphs, Discrete Mathematics, 86 (1990) 101–116. ⇒53, 54, 55, 5910.1016/0012-365X(90)90353-JSearch in Google Scholar

[6] M. B. Cozzens, L. L. Kelleher, Dominating sets in social network graphs, Mathematical Social Sciences16 (1988) 267–279. ⇒5310.1016/0165-4896(88)90041-8Search in Google Scholar

[7] E. J. Cockayne, R. M. Dawes, S. T. Hedetniemi, Total domination in graphs, Networks, 10 (1980) 211–219. ⇒5310.1002/net.3230100304Search in Google Scholar

[8] W. Duckworth, B. Mans, Connected domination of regular graphs, Discrete Mathematics309 (2009) 2305–2322. ⇒5310.1016/j.disc.2008.05.029Search in Google Scholar

[9] F. Harary, Graph Theory, Addison-Wesley, Reading, MA 1969. ⇒53, 57, 5810.21236/AD0705364Search in Google Scholar

[10] T. W. Haynes, S. T. Hedetniemi, P. J. Slater, Fundamentals of Domination, MD, 1998. ⇒53, 55Search in Google Scholar

[11] M. A. Henning, S. Mukwembi, Domination, radius, and minimum degree, Discrete Mathematics157 (2009) 2964–2968. ⇒5310.1016/j.dam.2009.04.009Search in Google Scholar

[12] I. M. James, History of Topology, UK, 1999. ⇒53Search in Google Scholar

[13] N. J. Kothari, S. K. Vaidya, Some new results on distance k-domination in graphs, International Journal of Combinatorics (2013). ⇒5310.1155/2013/795401Search in Google Scholar

[14] D. Kratsch, M. Liedlo, An exact algorithm for the minimum dominating clique problem, Theoretical Computer Science, 385 (2007) 226–240. ⇒5310.1016/j.tcs.2007.06.014Search in Google Scholar

[15] G. Mekiš, Lower bounds for the domination number and the total domination number of direct product graphs, Discrete Mathematics, 310 (2010) 3310–3317. ⇒5310.1016/j.disc.2010.07.015Search in Google Scholar

[16] E. Sampathkumar, H. B. Walikar, The connected domination number of a graph, Jour. Math. Phy. Sci.13 (1979) 607–613. ⇒53Search in Google Scholar

[17] D. B. West, Introduction to Graph Theory (2nd ed.), Pearson Education, 2002. ⇒53, 57, 58Search in Google Scholar

[18] E. S. Wolk, A note on “The comparability graph of a tree”, Proc. Amer. Math. Sot., 16 (1965) 17–20. ⇒5410.1090/S0002-9939-1965-0172274-5Search in Google Scholar