Inverse majority vertex covering number of a graph

  • Authors

    • Paulraj Jayasimman
    • Dhivya T
    • Joseline Manora J
    https://doi.org/10.14419/ijet.v7i4.21514

  • Abstract

    A set of vertices , which covers atleast half of the edges is a Majority vertex cover of . The majority vertex covering number  of is the minimum number in a Majority vertex cover. In this paper, new parameter has been introduced Inverse majority vertex covering number of a graph with respect to Majority vertex covering set. Also majority vertex covering number obtained for classic graphs and Cartesian product graph.

  • References

    1. [1] E.J. Cockayane and S.T. Hedetniemi, “Towards a theory of domination in graphsâ€, Networks. Seven, pp. 247-261, (1977). https://doi.org/10.1002/net.3230070305.

      [2] Frank Harary, Graph theory, Addision-Wesley, Reading, Mass., (1972).

      [3] T.W Haynes, S.T Hedetniemi and P.J Slater, Fundamentals of domination in graphs, Marces Dekker. Inc, New york, (1998).

      [4] J. Joseline Manora and V. Swaminathan, “Majority Dominating setsâ€, J A R J; Vol.3, No.2, pp.75-82, (2006).

      [5] J. Joseline Manora and V. Swaminathan, “Results on Majority Dominating setsâ€, Scientia Magna, Northwest University, Xitan, P.R China, Vol. 7, No. 3, pp. 53-58, (2011).

      [6] Joseline Manora .J and Swaminathan .V, Majority neighborhood number of a graph-published in Scientia Magna, Dept. of Mathematics, Northwest Universtiy, Xitan, P.R China – Vol (6), N0.2, 20-25(2010).

      [7] Joseline Masnora J and Paulraj Jayasimman. I, Independent Majority Neighborhood Number of a graph, International Journal of Applied Computational Science & Mathematics. Volume 4, Number 1 (2014), pp. 103-112. https://doi.org/10.5121/ijcsa.2014.4110.

      [8] Joseline Masnora J and Paulraj Jayasimman. Neighborhood sets polynomial of a graph, International Journal of Applied Mathematical Sciences, ISSN 0973-0176 Volume 6, Number 1 (2013), pp. 91-97.

      [9] Kulli.V.R and Kattimani, The Inverse Neighbourhood Number of a graph, South. East.Asian.J. Math. & Math. Sc. Vol.6 No.3 (2008), pp. 23-28.

      [10] V.R.Kulli,S.C, Sigarkanthi, Inverse domination in graphs, National Academic Science Letter, Vol.14,1991,pp 473-475.

      [11] V.R.Kulli, Inverse vertex covering number of a graph, Journal of Discrete Mathematical Sciences & Cryptography, Vol.15 (2012), No.6, pp.389-393.

      [12] E. Sampathkumar and H.B. Walikar, “The connected domination number of a graphâ€, Jour, Math, Phy, Sci. Vol.13 No.6, pp. 607-613 (1979).

  • Downloads

  • How to Cite

    Jayasimman, P., T, D., & J, J. M. (2018). Inverse majority vertex covering number of a graph. International Journal of Engineering & Technology, 7(4), 2925-2927. https://doi.org/10.14419/ijet.v7i4.21514

    Received date: 2018-11-25

    Accepted date: 2018-11-25