Operations on well-covered graphs and the Roller-Coaster conjecture

zbMath1054.05080MaRDI QIDQ1883660

Philip Matchett

Publication date: 13 October 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124095

zbMATH Keywords

independent setindependence polynomialwell-covered graphsindependence sequencepower magnificationRoller-Coaster conjecture

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Building graphs whose independence polynomials have only real roots ⋮ Well-covered circulant graphs ⋮ The roller-coaster conjecture revisited ⋮ Maximal-clique partitions and the roller coaster conjecture ⋮ Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture

This page was built for publication: Operations on well-covered graphs and the Roller-Coaster conjecture