On the coefficients of the independence polynomial of graphs
type: Item
instance of: scholarly article
title: On the coefficients of the independence polynomial of graphs
zbMATH Open document ID: 1369.05163
author: Shuchao Li
author: Lin Liu
author: Yueyu Wu
published in: Journal of Combinatorial Optimization
publication date: 2017-08-03T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6756024
zbMATH Keywords: independent set
zbMATH Keywords: diameter
zbMATH Keywords: girth
zbMATH Keywords: chromatic number
zbMATH Keywords: clique number
zbMATH Keywords: connectivity
MaRDI profile type: Publication
full work available at URL: s10878-016-0037-5
OpenAlex ID: W2471922464
cites work: Q5422499
cites work: On the Roots of Expected Independence Polynomials
cites work: The roots of the independence polynomial of a clawfree graph
cites work: Q3043192
cites work: Q5452543
cites work: Clique polynomials and independent set polynomials of graphs
cites work: Q3340886
cites work: Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
cites work: On tricyclic graphs of a given diameter with minimal energy
cites work: Further analysis on the total number of subtrees of trees
cites work: The matching energy of graphs with given parameters
cites work: On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
cites work: Q3931424
cites work: Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets
cites work: Independence polynomials of \(k\)-tree related graphs
cites work: On subtrees of trees
cites work: Maxima and minima of the Hosoya index and the Merrifield-Simmons index
cites work: On the unimodality of independence polynomials of some graphs
cites work: On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number
cites work: Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets
cites work: Extremal hexagonal chains concerning \(k\)-matchings and \(k\)-independent sets
cites work: Graphs with maximal Hosoya index and minimal Merrifield-Simmons index
DOI: 10.1007/S10878-016-0037-5
Recommended article: Independence polynomials of some compound graphs
Recommended article: On the maximal independence polynomial of certain graph configurations
Recommended article: On the independence polynomials of path-like graphs
Recommended article: On the independence number of graphs related to a polarity
Recommended article: On the independent domination polynomial of a graph
Recommended article: Independence polynomials of bipartite graphs
Recommended article: On the independence polynomial of an antiregular graph
Recommended article: The independence polynomial of rooted products of graphs
Recommended article: On the independence polynomial of the corona of graphs
Recommended article: Q4527723
description: scientific article; zbMATH DE number 6756024