论文信息 - k-Independence and the k-residue of a graph

k-Independence and the k-residue of a graph

Favaron, Mahéo, and Saclé proved that the residue of a simple graph G is a lower bound on its independence number α(G). For k ∈ N, a vertex set X in a graph is called k-independent, if the subgraph induced by X has maximum degree less than k. We prove that a generalization of the residue, the k-residue of a graph, yields a lower bound on the k-independence number. The new bound strengthens a bound of Caro and Tuza and improves all known bounds for some graphs. c © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 241–249, 1999

Frank Jelen | F. Jelen

[1] Zsolt Tuza,et al. Improved lower bounds on k-independence , 1991, J. Graph Theory.

[2] Daniel J. Kleitman,et al. Independence and the Havel-Hakimi residue , 1994, Discret. Math..

[3] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.

[4] Jerrold R. Griggs. Lower bounds on the independence number in terms of the degrees , 1983, J. Comb. Theory, Ser. B.

[5] Michael S. Jacobson,et al. On n-domination, n-dependence and forbidden subgraphs , 1985 .

[6] Siemion Fajtlowicz,et al. On conjectures of Graffiti , 1988, Discret. Math..

[7] Odile Favaron,et al. On the residue of a graph , 1991, J. Graph Theory.

[8] Eberhard Triesch,et al. Degree sequences of graphs and dominance order , 1996, J. Graph Theory.

[9] S. Hakimi. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .