Neighbourhood total domination in graphs

• Autorzy: Arumugam S. , Sivagnanam C.
• Języki publikacji: EN

Abstrakty

EN

Let G = (V, E) be a graph without isolated vertices. A dominating set S of G is called a neighbourhood total dominating set (ntd-set) if the induced subgraph 〈 N(S) 〉 has no isolated vertices. The minimum cardinality of a ntd-set of G is called the neighbourhood total domination number of G and is denoted by ϒnt(G). The maximum order of a partition of V into ntd-sets is called the neighbourhood total domatic number of G and is denoted by dnt(G). In this paper we initiate a study of these parameters.

Słowa kluczowe

EN

neighbourhood total domination; total domination; connected domination; paired domination; neighbourhood total domatic number

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2011
• Tom: Vol. 31, no. 4
• Strony: 519--531
• Opis fizyczny: Bibliogr. 10 poz., rys.

Twórcy

autor

Arumugam S.

autor

Sivagnanam C.

• Kalasalingam University National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH) Anand Nagar, Krishnankoil-626190, India,

Bibliografia

• [1] S. Arumugam, C. Sivagnanam, Neighbourhood connected domination in graphs, J. Combin. Math. Combin. Comput. 73 (2010), 55–64.
• [2] S. Arumugam, C. Sivagnanam, Neighbourhood connected domatic number of a graph, J. Combin. Math. Combin. Comput. 75 (2010), 239–249.
• [3] G. Chartrand, L. Lesniak, Graphs and Digraphs, Chapman and Hall, CRC, 4th edition, 2005.
• [4] E.J. Cockayne, R.M. Dawes, S.T. Hedetniemi, Total domination in graphs, Networks 10 (1980), 211–219.
• [5] T.W. Haynes, P.J. Slater, Paired domination in graphs, Networks 32 (1998), 199–206.
• [6] T.W. Haynes, S.T. Hedetniemi, P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker Inc., 1998.
• [7] T.W. Haynes, S.T. Hedetniemi, P.J. Slater, Domination in Graphs – Advanced Topics, Marcel Dekker Inc., 1998.
• [8] J. Paulraj, S. Arumugam, Domination and Connectivity in graphs, International Journal of Management and Systems 8 (1992) 3, 233–236.
• [9] E. Sampathkumar, H.B. Walikar, The connected domination number of a graph, J. Math. Phys. Sci. 13 (1979), 607–613.
• [10] B. Zelinka, Domatic number of graphs and their variants: A survey in Domination in graphs Advanced topics, Ed. T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Marcel Dekker, 1998.