Two relations between the parameters of independence and irredundance
暂无分享,去创建一个
Abstract In a simple graph, n, δ, i and IR denote respectively the number of vertices, the minimum degree, the order of a minimum maximal independent set and the order of a maximum irredundant set. We show that i + IR⩽2n + 2δ − 2 2nδ , which was conjectured by Cockayne, Favaron, Payan and Thomason, and that i + 2 δIR ⩽n + δ .
[1] Chengde Wang. On the sum of two parameters concerning independence and irredundance in a graph , 1988, Discret. Math..
[2] Odile Favaron,et al. Contributions to the theory of domination, independence and irredundance in graphs , 1981, Discret. Math..
[3] Béla Bollobás,et al. Graph-theoretic parameters concerning domination, independence, and irredundance , 1979, J. Graph Theory.