Independence polynomials of bipartite graphs

DOI10.1007/S40840-022-01326-9MaRDI QIDQ2091140zbMATH OpenOpenAlexFDO

Authors Huihui Zhang, Xia Hong

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 graphdiameterconnectivityindependence polynomialmatching number

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

• On the coefficients of the independence polynomial of graphs
• Optimal graphs for independence and \(k\)-independence polynomials
• scientific article; zbMATH DE number 6257565
• Independence polynomials of some graphs with extremal Fibonacci index
• Independence polynomials of \(k\)-tree related graphs

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?)
• scientific article; zbMATH DE number 32144 (Why is no real title available?)
• scientific article; zbMATH DE number 6260097 (Why is no real title available?)
• A survey on recurrence relations for the independence polynomial of hypergraphs
• An upper bound on the number of independent sets in a tree.
• Clique polynomials and independent set polynomials of graphs
• Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth
• Constructing combinatorial objects via cliques
• Edge-contributions of some topological indices and arboreality of molecular 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
• Independence polynomials of Fibonacci trees are log-concave
• Independence polynomials of \(k\)-tree related graphs
• Independent sets in graphs
• Independent sets, matchings, and occupancy fractions
• Log-concavity of independence polynomials of some kinds of trees
• Log-concavity of some independence polynomials via a partial ordering
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• Maximal-clique partitions and the roller coaster conjecture
• Merrifield-Simmons index and minimum number of independent sets in short trees
• Minimizing the number of independent sets in triangle-free regular graphs
• Note on the smallest root of the independence polynomial
• On the coefficients of the independence polynomial of graphs
• On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
• On the roots of expected independence polynomials
• On the spectral moment of graphs with \(k\) cut edges
• On the stability of independence polynomials
• On the unimodality of independence polynomials of very well-covered graphs
• Some results on the independence polynomial of unicyclic graphs
• The number of independent sets in a regular graph
• The roots of the independence polynomial of a clawfree graph
• Unimodality of independence polynomials of rooted products of graphs
• Unimodality of the independence polynomials of some composite graphs

Cited in

(6)

• Bipartite graphs can have any number of independent sets
• Optimal graphs for independence and \(k\)-independence polynomials
• On the coefficients of the independence polynomial of graphs
• Bipartite density and the independence ratio
• scientific article; zbMATH DE number 6808069 (Why is no real title available?)
• Julia set of some graphs using independence polynomials

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

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