Bipartite theory of irredundant set
DOI:
https://doi.org/10.4067/10.4067/S0716-09172011000100002Keywords:
Bipartite graph, X−irredundant set, Hyper Y −irredundant set, Edge-vertex and vertex-edge irredundant sets.Abstract
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.References
[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, pp. 953-958, (2009).
[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, pp. 953-958, (2009).
Published
2011-05-25
How to Cite
[1]
V. Swaminathan and Y. B. Venkatakrishnan, “Bipartite theory of irredundant set”, Proyecciones (Antofagasta, On line), vol. 30, no. 1, pp. 19-28, May 2011.
Issue
Section
Artículos
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
