Independence Sequences of Well-Covered Graphs: Non-Unimodality and the Roller-Coaster Conjecture


A graph G is well-covered provided each maximal independent set of vertices has the same cardinality. The term sk of the independence sequence (s0, s1, . . . , sα) equals the number of independent k-sets of vertices of G. We investigate constraints on the linear orderings of the terms of the independence sequence of well-covered graphs. In particular, we… (More)
DOI: 10.1007/s00373-002-0515-7

3 Figures and Tables


  • Presentations referencing similar topics