Equitable Power Domination Number of Mycielskian of Certain Graphs

  • Authors

    • S. Banu Priya
    • A. Parthiban
    • N. Srinivasan
    https://doi.org/10.14419/ijet.v7i4.10.26772

    Received date: January 30, 2019

    Accepted date: January 30, 2019

    Published date: October 2, 2018

  • Dominating set, Equitable dominating set, Power dominating set, Equitable power dominating set, Equitable power domination number, Mycielskian graph

  • Abstract

    Let  be a simple graph with vertex set  and edge set . A set  is called a power dominating set (PDS), if every vertex   is observed by some vertices in  by using the following rules: (i) if a vertex  in  is in PDS, then it dominates itself and all the adjacent vertices of  and (ii) if an observed vertex  in   has  adjacent vertices and if   of these vertices are already observed, then the remaining one non-observed vertex is also observed by  in . A power dominating set    in   is said to be an equitable power dominating set (EPDS), if for every  there exists an adjacent vertex   such that the difference between the degree of  and degree of  is less than or equal to 1, i.e., . The minimum cardinality of an equitable power dominating set of  is called the equitable power domination number of  and denoted by . The Mycielskian of a graph  is the graph  with vertex set  where , and edge set  In this paper we investigate the equitable power domination number of Mycielskian of certain graphs.

     

  • References

    1. Anitha A, Arumugam S & Chellali M (2011), Equitable Domination in Graphs, Discrete Mathematics, Algorithms and Applications, Vol. 03, pp. 311-321.
    2. Baldwin TL, Mili L, Boisen MB, & Adapa R (1993), Power System Observability With Minimal Phasor Measurement Placement, IEEE Trans, Vol. 8, pp. 707-715.
    3. Banu Priya S & Srinivasan N (2018), Equitable power domination number of certain graphs, Int. J. of Eng. & Tech. (UAE), Vol. 7, No. 4.10, pp. 349-354.
    4. Barrera R & Ferrero D (2011), Power Domination in Cylinders, Tori, and Generalized Petersen Graphs, Networks, Vol. 58, pp. 43-49.
    5. Bondy JA & Murthy USR (1986), Graph Theory with Applications, Elsevier, North Holland, New York.
    6. Gera R, Horton S & Rasmussen C (2006), Dominator colorings and safe clique partitions, Congressus Numerantium, Vol. 181, pp. 19-32.
    7. Hedetniemi ST & Laskar RC (1990), Bibliography on domination in graphs and some basic definitions of domination parame-ters, Discrete Mathematics, Vol. 86, No. 1–3, pp. 257–277.
    8. Parthiban A & Gnanamalar David N (2018), On Finite Prime Dis-tance Graphs, Indian Journal of Pure and Applied Mathematics, (To appear).
    9. Swaminathan V & Dharmalingam KM (2011), Degree equitable domination on graphs, Kragujevac Journal of Mathematics, Vol. 35, No. 1, pp. 191–197.
    10. Mycielski (1955), Sur le coloriage des graphes, Colloq. Math., Vol. 3, pp. 161-162.

  • Downloads

  • How to Cite

    Banu Priya, S., Parthiban, A., & Srinivasan, N. (2018). Equitable Power Domination Number of Mycielskian of Certain Graphs. International Journal of Engineering and Technology, 7(4.10), 842-845. https://doi.org/10.14419/ijet.v7i4.10.26772