On real-rootedness of independence polynomials of rooted products of graphs

DOI10.1007/S10255-023-1088-XzbMATH Open1527.05141OpenAlexW4388492029MaRDI QIDQ6089355FDOQ6089355

Authors: Aria Ming-yue Zhu, Bao-Xuan Zhu 

Publication date: 17 November 2023

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-023-1088-x

Recommendations

• The independence polynomial of rooted products of graphs
• Unimodality of independence polynomials of rooted products of graphs
• Roots of independence polynomials of well covered graphs
• On the roots of independence polynomials of almost all very well-covered graphs
• New families of graphs whose independence polynomials have only real roots
• On trees with real-rooted independence polynomial
• Building graphs whose independence polynomials have only real roots
• On the coefficients of the independence polynomial of graphs
• On the largest real root of independence polynomials of trees.
• The roots of the independence polynomial of a clawfree graph

zbMATH Keywords

unimodalityindependence polynomialsreal zerosclaw-free graphsrooted products

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Combinatorial inequalities (05A20)

Cites Work

• Theory of monomer-dimer systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• On linear transformations preserving the Pólya frequency property
• The 𝐬-Eulerian polynomials have only real roots
• Title not available (Why is that?)
• Roots of independence polynomials of well covered graphs
• Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Symmetry and unimodality of independence polynomials of path-like graphs
• The unimodality of independence polynomials of some graphs
• On the location of roots of independence polynomials
• On the unimodality of independence polynomials of some graphs
• Building graphs whose independence polynomials have only real roots
• A unified approach to polynomial sequences with only real zeros
• Polynomials with real zeros and Pólya frequency sequences
• Average independence polynomials
• On the numbers of independent \(k\)-sets in a claw free graph
• On the roots of independence polynomials of almost all very well-covered graphs
• Clique cover products and unimodality of independence polynomials
• Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
• On the independence polynomials of path-like graphs
• A new graph product and its spectrum
• Title not available (Why is that?)
• An introduction to chromatic polynomials
• The roots of the independence polynomial of a clawfree graph
• Unimodality, log-concavity, real-rootedness and beyond
• Title not available (Why is that?)
• Unimodality of independence polynomials of the incidence product of graphs
• Unimodality of independence polynomials of rooted products of graphs
• Unimodality of the independence polynomials of some composite graphs
• On the independent set sequence of a tree
• On trees with real-rooted independence polynomial
• The independent set sequence of some families of trees
• Log-concavity of independence polynomials of some kinds of trees
• Title not available (Why is that?)
• Unimodality of the independence polynomials of non-regular caterpillars

Cited In (2)

• The circuit polynomial of the restricted rooted product \(G(\Gamma )\) of graphs with a bipartite core \(G\)
• Roots of independence polynomials of well covered graphs

This page was built for publication: On real-rootedness of independence polynomials of rooted products of graphs

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