On the coefficients of the independence polynomial of graphs

DOI10.1007/s10878-016-0037-5zbMath1369.05163OpenAlexW2471922464MaRDI QIDQ2012888

Yueyu Wu, Lin Liu, Shuchao Li

Publication date: 3 August 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0037-5

zbMATH Keywords

diameterconnectivityindependent setchromatic numbergirthclique number

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (4)

Independence Equivalence Classes of Paths and Cycles ⋮ Extremal colorings and independent sets ⋮ Extremal phenylene chains with respect to the coefficients sum of the permanental polynomial, the spectral radius, the Hosoya index and the Merrifield-Simmons index ⋮ Independence polynomials of bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the unimodality of independence polynomials of some graphs
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• The matching energy of graphs with given parameters
• The roots of the independence polynomial of a clawfree graph
• On tricyclic graphs of a given diameter with minimal energy
• On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number
• On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
• Independence polynomials of \(k\)-tree related graphs
• Clique polynomials and independent set polynomials of graphs
• On subtrees of trees
• Further analysis on the total number of subtrees of trees
• Graphs with maximal Hosoya index and minimal Merrifield-Simmons index
• Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets
• Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets
• Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
• On the Roots of Expected Independence Polynomials
• Extremal hexagonal chains concerning \(k\)-matchings and \(k\)-independent sets

This page was built for publication: On the coefficients of the independence polynomial of graphs