Well-covered circulant graphs

DOI10.1016/j.disc.2010.11.007zbMath1222.05208OpenAlexW2094278957MaRDI QIDQ626761

Richard Hoshino, Jason I. Brown

Publication date: 18 February 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.11.007

zbMATH Keywords

cubic graphscirculant graphindependence polynomialwell-covered graphpowers of cycles

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (16)

A large class of graphs with a small subclass of Cohen–Macaulay members ⋮ Graded Betti numbers of some families of circulant graphs ⋮ On CIS circulants ⋮ Chordal circulant graphs and induced matching number ⋮ On Gorenstein circulant graphs ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ Vertex-transitive CIS graphs ⋮ Cohen–Macaulay Circulant Graphs ⋮ Independence Complexes of Well-Covered Circulant Graphs ⋮ On the reduced Euler characteristic of independence complexes of circulant graphs ⋮ Cohen-Macaulayness of two classes of circulant graphs ⋮ Betti numbers of some circulant graphs ⋮ Unnamed Item ⋮ Partitions and well-coveredness: the graph sandwich problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• Independence polynomials of circulants with an application to music
• A characterization of well covered graphs of girth 5 or greater
• Independence sequences of well-covered graphs: Non-unimodality and the roller-coaster conjecture
• Roots of independence polynomials of well covered graphs
• A survey on multi-loop networks.
• Operations on well-covered graphs and the Roller-Coaster conjecture
• Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
• Normal hypergraphs and the perfect graph conjecture
• Complexity results for well‐covered graphs
• WELL-COVERED GRAPHS: A SURVEY
• Spectral analysis of Boolean functions as a graph eigenvalue problem
• Some covering concepts in graphs
• On the strong perfect graph conjecture

This page was built for publication: Well-covered circulant graphs