Roots of independence polynomials of well covered graphs

DOI10.1023/A:1008705614290zbMATH Open0994.05109OpenAlexW1509680213MaRDI QIDQ1577528FDOQ1577528

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

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

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)

Cites Work

• Title not available (Why is that?)
• Polynomial invariants of graphs. II
• WELL-COVERED GRAPHS: A SURVEY
• Title not available (Why is that?)
• Some covering concepts in graphs
• Dependence polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the theory of the matching polynomial
• Title not available (Why is that?)
• Clique polynomials and independent set polynomials of graphs
• On the numbers of independent \(k\)-sets in a claw free graph
• Title not available (Why is that?)
• A Generalization of a Theorem of Bôcher
• Title not available (Why is that?)
• Lower bounds on the number of triangles in a graph
• Two combinatorial applications of the Aleksandrov-Fenchel inequalities
• Title not available (Why is that?)
• Roots of the Reliability Polynomials
• Title not available (Why is that?)
• On the Eneström-Kakeya theorem and its sharpness
• On the log concavity of reliability and matroidal sequences
• On the unimodality of the independent set numbers of a class of matroids
• Title not available (Why is that?)
• Bounds on the number of complete subgraphs
• Polynomials
• On Unimodality for Linear Extensions of Partial Orders
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (44)

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