Optimal graphs for independence and \(k\)-independence polynomials

DOI10.1007/s00373-018-1946-0zbMath1402.05106arXiv1710.03249OpenAlexW2963598847WikidataQ129293306 ScholiaQ129293306MaRDI QIDQ1756111

Jason I. Brown, Danielle Cox

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.03249

zbMATH Keywords

independence polynomialoptimal graph\(k\)-clique-free graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Optimal domination polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lexifying ideals
• Independence polynomials of circulants with an application to music
• Simplicial complexes of graphs
• Optimal graphs for chromatic polynomials
• Dependence polynomials
• SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS
• Uniformly-most reliable networks do not always exist
• Least reliable networks and the reliability domination
• The Upper Bound Conjecture and Cohen-Macaulay Rings
• Componentwise linear ideals
• Uniformly optimally reliable graphs
• Nonexistence of optimal graphs for all terminal reliability
• Graphs with least number of colorings
• On the existence of uniformly optimally reliable networks
• Proofs from THE BOOK