Degree sequence index strategy

We introduce a procedure, called the Degree Sequence Index Strategy (DSI), by which to bound graph invariants by certain indices in the ordered degree sequence. As an illustration of the DSI strategy, we show how it can be used to give new upper and lower bounds on the $k$-independence and the $k$-domination numbers. These include, among other things, a double generalization of the annihilation number, a recently introduced upper bound on the independence number. Next, we use the DSI strategy in conjunction with planarity, to generalize some results of Caro and Roddity about independence number in planar graphs. Lastly, for claw-free and $K_{1,r}$-free graphs, we use DSI to generalize some results of Faudree, Gould, Jacobson, Lesniak and Lindquester.

[1]  M. Jacobson,et al.  n-Domination in graphs , 1985 .

[2]  Odile Favaron,et al.  Maximal k-independent sets in graphs , 2008, Discuss. Math. Graph Theory.

[3]  Noga Alon,et al.  Approximating the independence number via theϑ-function , 1998, Math. Program..

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

[5]  Odile Favaron,et al.  On a conjecture of Fink and Jacobson concerning k-domination and k-dependence , 1985, J. Comb. Theory B.

[6]  Frank Göring,et al.  GreedyMAX-type Algorithms for the Maximum Independent Set Problem , 2011, SOFSEM.

[7]  Wayne Goddard,et al.  Bounds on the k-domination number of a graph , 2011, Appl. Math. Lett..

[8]  Marko Vukolic,et al.  SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings , 2011, SOFSEM.

[9]  Yair Caro,et al.  New Approach to the k-Independence Number of a Graph , 2012, Electron. J. Comb..

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

[11]  E. DeLaViña.  Graffiti . pc on the k-independence number of a graph , .

[12]  Ermelinda DeLaViña,et al.  Graffiti . pc on the 2-domination number of a graph , 2010 .

[13]  David Amos,et al.  On the k-residue of disjoint unions of graphs with applications to k-independence , 2014, Discret. Math..

[14]  William Willis.  Bounds for the independence number of a graph , 2011 .

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

[16]  Michael S. Jacobson,et al.  On independent generalized degrees and independence numbers in K(1, m)-free graphs , 1992, Discret. Math..

[17]  Adriana Hansberg,et al.  On kk-domination and jj-independence in graphs , 2013, Discret. Appl. Math..

[18]  Odile Favaron,et al.  k-Domination and k-Independence in Graphs: A Survey , 2012, Graphs Comb..

[19]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[20]  Craig E. Larson,et al.  Graphs with equal Independence and Annihilation Numbers , 2011, Electron. J. Comb..

[21]  Ryan Pepper,et al.  On the annihilation number of a graph , 2009 .

[22]  Yair Caro,et al.  A note on the k-domination number of a graph , 1990 .

[23]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[24]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.