Bipartite theory of irredundant set

• Swaminathan, V. ^[2] ; Venkatakrishnan, Y. B. ^[1]
  1. [1] SASTRA University

     SASTRA University

     India

     
  2. [2] S. N. College.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 30, Nº. 1, 2011, págs. 19-28
• Idioma: inglés
• DOI: 10.4067/10.4067/S0716-09172011000100002
• Enlaces
  • Texto completo
• Resumen

  • The bipartite version of irredundant set, edge-vertex irredundant set and vertex-edge irredundant set are introduced. Using the bipartite theory of graph, IRve(G)+γ(G) = |V| and γve(G)+IR(G) = |V| are proved.

• Referencias bibliográficas
  • Citas [1] Bondy J. A., Murthy U. S. R., Graph theory with applications, London Macmillan (1976).
  • [2] Haynes T. W., Hedetniemi. S. T. and Slater P. J., Fundamentals of Domination in graphs, Marcel Dekker, New York, (1998).
  • [3] Jason Robert Lewis, Vertex-edge and edge-vertex parameters in graphs, (Ph. D Thesis), Clemson University, August 2007.
  • [4] Stephen Hedetniemi, Renu Laskar, A Bipartite theory of graphs I, Congressus Numerantium, Volume 55; pp. 5—14, December 1986.
  • [5] Stephen Hedetniemi, Renu Laskar, A Bipartite theory of graphs II, Congressus Numerantium, Volume 64; pp. 137-146, November 1988.
  • [6] Swaminathan V. and Venkatakrishnan Y. B., Hyper Y -domination in Bipartite graphs, International Mathematical Forum, Volume 4, No. 20,...