The independence polynomial of rooted products of graphs
From MaRDI portal
Publication:968175
DOI10.1016/J.DAM.2009.10.009zbMATH Open1201.05048OpenAlexW1969007797MaRDI QIDQ968175FDOQ968175
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.10.009
Recommendations
Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- 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?)
- Title not available (Why is that?)
- On the location of roots of independence polynomials
- Recent results in the theory of graph spectra
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Clique polynomials and independent set polynomials of graphs
- Average independence polynomials
- On the roots of independence polynomials of almost all very well-covered graphs
- A new graph product and its spectrum
- Title not available (Why is that?)
- The roots of the independence polynomial of a clawfree graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounding the roots of independence polynomials.
- On Dependency Graphs and the Lattice Gas
- Title not available (Why is that?)
- Algorithmic uses of the Feferman-Vaught theorem
- The circuit polynomial of the restricted rooted product \(G(\Gamma )\) of graphs with a bipartite core \(G\)
- Title not available (Why is that?)
- On F-polynomials of thistles
- Products of graceful trees
- An introduction to \(F\)-graphs, a graph-theoretic representation of natural numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (18)
- Title not available (Why is that?)
- Certificates for properties of stability polynomials of graphs
- Building graphs whose independence polynomials have only real roots
- Clique cover products and unimodality of independence polynomials
- The \(k\)-path vertex cover of rooted product graphs
- Log-concavity of independence polynomials of some kinds of trees
- The circuit polynomial of the restricted rooted product \(G(\Gamma )\) of graphs with a bipartite core \(G\)
- Independent vertex sets in the Zykov sum
- Unimodality of the independence polynomials of some composite graphs
- Roots of independence polynomials of well covered graphs
- Upper bounds for the independence polynomial of graphs at \(-1\)
- On the coefficients of the independence polynomial of graphs
- Unimodality of independence polynomials of the incidence product of graphs
- On the roots of independence polynomials of almost all very well-covered graphs
- On real-rootedness of independence polynomials of rooted products of graphs
- Generalizations of the matching polynomial to the multivariate independence polynomial
- The independent set sequence of some families of trees
- Bounds on the Twin-Width of Product Graphs
This page was built for publication: The independence polynomial of rooted products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968175)