Roots of independence polynomials of well covered graphs

DOI10.1023/A:1008705614290MaRDI QIDQ1577528zbMATHOpenAlexFDO

Authors Jason I. Brown, Karl Dilcher, R. J. Nowakowski

Publication date 10 October 2002

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008705614290

zbMATH Keywords

independence polynomialindependent setswell covered graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the roots of independence polynomials of almost all very well-covered graphs
• The independence polynomial of rooted products of graphs
• On the roots of edge cover polynomials of graphs
• On real-rootedness of independence polynomials of rooted products of graphs
• The roots of the independence polynomial of a clawfree graph
• On the coefficients of the independence polynomial of graphs
• On the roots of domination polynomial of graphs
• On the roots of total domination polynomial of graphs
• Independence roots and independence fractals of certain graphs
• On the unimodality of independence polynomials of very well-covered graphs

Cites work

• scientific article; zbMATH DE number 3836093 (Why is no real title available?)
• scientific article; zbMATH DE number 3882488 (Why is no real title available?)
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 4091530 (Why is no real title available?)
• scientific article; zbMATH DE number 4112649 (Why is no real title available?)
• scientific article; zbMATH DE number 3683507 (Why is no real title available?)
• scientific article; zbMATH DE number 32144 (Why is no real title available?)
• scientific article; zbMATH DE number 166023 (Why is no real title available?)
• scientific article; zbMATH DE number 528857 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• scientific article; zbMATH DE number 3368629 (Why is no real title available?)
• A Generalization of a Theorem of Bôcher
• Bounds on the number of complete subgraphs
• Clique polynomials and independent set polynomials of graphs
• Dependence polynomials
• Lower bounds on the number of triangles in a graph
• On Unimodality for Linear Extensions of Partial Orders
• On the Eneström-Kakeya theorem and its sharpness
• On the log concavity of reliability and matroidal sequences
• On the numbers of independent \(k\)-sets in a claw free graph
• On the theory of the matching polynomial
• On the unimodality of the independent set numbers of a class of matroids
• Polynomial invariants of graphs. II
• Polynomials
• Roots of the Reliability Polynomials
• Some covering concepts in graphs
• Two combinatorial applications of the Aleksandrov-Fenchel inequalities
• WELL-COVERED GRAPHS: A SURVEY

Cited in

(44)

• Average independence polynomials
• The \(k\)-fractal of a simplicial complex
• Graphs whose certain polynomials have few distinct roots
• The independence fractal of a graph.
• Building graphs whose independence polynomials have only real roots
• On the roots of strongly connected reliability polynomials
• A note on purely imaginary independence roots
• The roller-coaster conjecture revisited
• Clique cover products and unimodality of independence polynomials
• On real-rootedness of independence polynomials of rooted products of graphs
• The independence polynomial of rooted products of graphs
• Distinctive power of the alliance polynomial for regular graphs
• Well-covered unitary Cayley graphs of matrix rings over finite fields and applications
• Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs
• On the location of roots of independence polynomials
• Co-2-plex polynomials
• Domination Polynomials of certain hexagon lattice graphs
• Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
• On the unimodality of independence polynomials of some graphs
• A simple proof of an inequality connecting the alternating number of independent sets and the decycling number
• The roots of the independence polynomial of a clawfree graph
• Computing the strong alliance polynomial of a graph
• Unimodality of the independence polynomials of some composite graphs
• On the unimodality of independence polynomials of very well-covered graphs
• Maximum modulus of independence roots of graphs and trees
• Bounding the roots of independence polynomials.
• On the stability of independence polynomials
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• On the roots of expected independence polynomials
• Well-covered circulant graphs
• Independent set and matching permutations
• Total coloring of certain classes of product graphs
• Operations on well-covered graphs and the Roller-Coaster conjecture
• Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
• On the differential polynomial of a graph
• Alliance polynomial of regular graphs
• On the independence polynomial of the corona of graphs
• Maximal-clique partitions and the roller coaster conjecture
• A way to construct independence equivalent graphs
• Independence polynomials of circulants with an application to music
• Independence equivalence classes of paths and cycles
• On the roots of independence polynomials of almost all very well-covered graphs
• The cyclomatic number of a graph and its independence polynomial at \(- 1\)
• Independence polynomials of some compound graphs

This page was built for publication: Roots of independence polynomials of well covered graphs

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