Independence polynomials of bipartite graphs

DOI10.1007/s40840-022-01326-9zbMath1501.05011OpenAlexW4281722593MaRDI QIDQ2091140

Xia Hong, Huihui Zhang

Publication date: 31 October 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-022-01326-9

zbMATH Keywords

bipartite graphdiameterconnectivitymatching numberindependence polynomial

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on recurrence relations for the independence polynomial of hypergraphs
• Independent sets in graphs
• Maximal-clique partitions and the roller coaster conjecture
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• The roots of the independence polynomial of a clawfree graph
• 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
• Log-concavity of some independence polynomials via a partial ordering
• Minimizing the number of independent sets in triangle-free regular graphs
• On the unimodality of independence polynomials of very well-covered graphs
• Some results on the independence polynomial of unicyclic graphs
• On the stability of independence polynomials
• Further analysis on the total number of subtrees of trees
• Log-concavity of independence polynomials of some kinds of trees
• On the coefficients of the independence polynomial of graphs
• Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth
• Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets
• Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets
• Edge-contributions of some topological indices and arboreality of molecular graphs
• The Number of Independent Sets in a Regular Graph
• Note on the Smallest Root of the Independence Polynomial
• Unimodality of independence polynomials of rooted products of graphs
• Unimodality of the independence polynomials of some composite graphs
• On the Roots of Expected Independence Polynomials
• Independent sets, matchings, and occupancy fractions
• On the spectral moment of graphs with $k$ cut edges
• Extremal hexagonal chains concerning \(k\)-matchings and \(k\)-independent sets

This page was built for publication: Independence polynomials of bipartite graphs