Independence polynomials of circulants with an application to music

DOI10.1016/j.disc.2008.05.003zbMath1228.05178OpenAlexW2053952882MaRDI QIDQ1025487

Jason I. Brown, Richard Hoshino

Publication date: 19 June 2009

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

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

zbMATH Keywords

musicindependence polynomialcirculantpowers of cycles

Mathematics Subject Classification ID

Graph polynomials (05C31) Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

A large class of graphs with a small subclass of Cohen–Macaulay members, Graded Betti numbers of some families of circulant graphs, CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS, Clique complexes and graph powers, On CIS circulants, Chordal circulant graphs and induced matching number, Well-covered circulant graphs, INDEPENDENT SETS FROM AN ALGEBRAIC PERSPECTIVE, Acyclic polynomials of graphs, Cohen–Macaulay Circulant Graphs, Optimal graphs for independence and \(k\)-independence polynomials, 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, Colouring clique-hypergraphs of circulant graphs

Cites Work

• On the location of roots of independence polynomials
• The strong perfect graph theorem
• Triangle-free subgraphs of powers of cycles
• Motivations and history of some of my conjectures
• The independence fractal of a graph.
• Independence sequences of well-covered graphs: Non-unimodality and the roller-coaster conjecture
• Roots of independence polynomials of well covered graphs
• Colouring powers of cycles from random lists
• Normal hypergraphs and the perfect graph conjecture
• Dependence polynomials
• Induced Subgraphs of the Power of a Cycle
• Spectral analysis of Boolean functions as a graph eigenvalue problem
• PRODUCTS OF CIRCULANT GRAPHS
• On the computational complexity of the Jones and Tutte polynomials
• On the strong perfect graph conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item