On the coefficients of the independence polynomial of graphs

DOI10.1007/S10878-016-0037-5MaRDI QIDQ2012888zbMATH OpenOpenAlexFDO

Authors Shuchao Li, Lin Liu, Yueyu Wu

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

chromatic numberdiameterclique numberconnectivitygirthindependent set

Mathematics Subject Classification ID

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

Recommendations

• Independence polynomials of some compound graphs
• On the maximal independence polynomial of certain graph configurations
• On the independence polynomials of path-like graphs
• On the independence number of graphs related to a polarity
• On the independent domination polynomial of a graph
• Independence polynomials of bipartite graphs
• On the independence polynomial of an antiregular graph
• The independence polynomial of rooted products of graphs
• On the independence polynomial of the corona of graphs
• scientific article; zbMATH DE number 1557817

Cites work

• scientific article; zbMATH DE number 3836093 (Why is no real title available?)
• scientific article; zbMATH DE number 3873364 (Why is no real title available?)
• scientific article; zbMATH DE number 3745213 (Why is no real title available?)
• Clique polynomials and independent set polynomials of graphs
• Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets
• Extremal energy trees
• Extremal hexagonal chains concerning \(k\)-matchings and \(k\)-independent sets
• Extremal polyomino chains on k-matchings and k-independent sets
• Further analysis on the total number of subtrees of trees
• Graph theory
• Graphs with maximal Hosoya index and minimal Merrifield-Simmons index
• Independence polynomials of \(k\)-tree related graphs
• Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• On subtrees of trees
• 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
• On the roots of expected independence polynomials
• On the unimodality of independence polynomials of some graphs
• On tricyclic graphs of a given diameter with minimal energy
• The matching energy of graphs with given parameters
• The roots of the independence polynomial of a clawfree graph

Cited in

(14)

• Independence polynomials of \(k\)-tree related graphs
• Independence polynomials of some compound graphs
• Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
• 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
• Extremal colorings and independent sets
• scientific article; zbMATH DE number 3882467 (Why is no real title available?)
• Roots of independence polynomials of well covered graphs
• An algorithm for calculating the independence and vertex-cover polynomials of a graph
• On the independence polynomial of an antiregular graph
• On the maximal independence polynomial of certain graph configurations
• On real-rootedness of independence polynomials of rooted products of graphs
• scientific article; zbMATH DE number 903282 (Why is no real title available?)
• Independence equivalence classes of paths and cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012888)