A Study on Connected Domination Transition Number of a Graph

  • Authors

    • Kaspar S
    • B. Gayathri
    • D. Kalpanapriya
    • M. P. Kulandaivel
    2018-10-02
    https://doi.org/10.14419/ijet.v7i4.10.20916
  • connected domination, domination, connected domination transition number, graph, independence number of a graph, tree.

  • Since its inception, the notion of domination has found vital roles in several real life applications related to facility locations, representatives’ selection, communication networks, electrical networks, etc. The vast application of the notion has paved the way for the development of the notion with several types. The notion of connected domination is a significant domination parameter amongst the several domination varieties emerged in this domain. The problem of determining limited bus stops in a route was effectively addressed by the connected domination parameter. Most of the biological and neural networks effectively use this notion to solve several problems which require the connectedness of the structures. In view of the growing applications of the variant, several researchers and scholars have published numerous research articles on the said parameter. Recently, some researchers attempted on transition of the domination parameter into a connected one. In order to facilitate this transition, another variant viz., connected domination transition number was introduced and its properties and bounds were studied. In this article we explore more properties and bounds of the parameter connected domination transition number for special types of graphs. We also characterize the instances at which the domination and connected domination parameters would be same for few types of graphs. We also attempted to derive few Nordhaus–Gaddum (NG) type results for the same.

     

  • References

    1. [1] C. Berge, 1962: Theory of Graphs and its Applications. Methuen, London.

      [2] O. Ore, 1962: Theory of Graphs. Amer. Math. Soc. Colloq. Publ., 38, Providence.

      [3] E. Sampathkumar, and H.B. Walikar, 1979: The connected domination number of a graphs. J. Math. Phys. Sci., 13(6), 607–613.

      [4] S.T.Hedetniemi and R.C.Laskar, 1984: Connected domination in Graphs. Graph Theory and Combinatorics, B.Bollobas, Ed., Academic press, London, 209–218.

      [5] S. Arumugam, and P. Joseph, 1999: On graphs with equal domination and connected domination numbers. Discrete Math., 206, 45–49.

      [6] Kaspar S, B. Gayathri, M.P. Kulandaivel, N. Shobanadevi J.Nieminen, 2017: Towards connected domination in graphs. Int. J. Pure and Applied Math., 117(14), 53–62.

      [7] R. Laskar and K. Peters, 1985: Vertex and edge domination parameters in graphs. Congr. Numer., 48, 291–305.

      [8] F. Harary and T.W. Haynes, 1996: Nordhaus-Gaddum inequalities for domination in graphs. Discrete Math., 155, 99–105.

      [9] M. Lemanska, 2004: Lower bound on the domination number of a tree. Discuss. Math. Graph Theory, 24, 165–169.

      [10] E.A. Nordhaus and J.W Gaddum, 1956: On complementary graphs. Amer. Math. Monthly, 63, 175–177.

      [11] F. Jaeger and C. Payan, 1972: Relations du type Nordhaus–Gaddum pour le nombre d'absorption d'un graphe simple. C.R. Math. Acad. Sci. Paris, A 274, 728–730.

      [12] E.J. Cockayne, and S.T. Hedetniemi, 1977: Towards the theory of domination in graphs. Networks, 7, 247–261.

  • Downloads

  • How to Cite

    S, K., Gayathri, B., Kalpanapriya, D., & P. Kulandaivel, M. (2018). A Study on Connected Domination Transition Number of a Graph. International Journal of Engineering & Technology, 7(4.10), 298-302. https://doi.org/10.14419/ijet.v7i4.10.20916