Dependence polynomials

From MaRDI portal
Publication:2640617

DOI10.1016/0012-365X(90)90202-SzbMath0721.05036OpenAlexW2914085271MaRDI QIDQ2640617

David C. Fisher, Anita E. Solow

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90202-s




Related Items

The \(k\)-fractal of a simplicial complexOn the dependence polynomial of a graphUnnamed ItemOne more remark on the adjoint polynomialOn the location of roots of independence polynomialsAlgorithmic uses of the Feferman-Vaught theoremThe roots of the independence polynomial of a clawfree graphFarrell polynomials on graphs of bounded tree widthDependence polynomials of some graph operationsMehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphsA new algorithm for compression of partially commutative alphabetsThe independence fractal of a graph.A way to construct independence equivalent graphsShearer's measure and stochastic domination of product measuresGraphs with a minimal number of convex setsNote on the Smallest Root of the Independence PolynomialOn the roots of independence polynomials of almost all very well-covered graphsOptimal graphs for independence and \(k\)-independence polynomialsOn a sequence of sparse binomial-type polynomialsBounds on the largest root of the matching polynomialThe repulsive lattice gas, the independent-set polynomial, and the Lovász local lemmaCharacteristic polynomials of nonnegative real square matrices and generalized clique polynomialsAverage independence polynomialsIndependence polynomials of well-covered graphs: generic counterexamples for the unimodality conjectureFrom a zoo to a zoology: Towards a general theory of graph polynomialsIndependence polynomials of circulants with an application to musicAlgorithms for the fixed point propertyRoots of independence polynomials of well covered graphsGeneralizations of the matching polynomial to the multivariate independence polynomialReconstructing subgraph-counting graph polynomials of increasing families of graphsOn the number of edge-disjoint triangles in \(K_4\)-free graphsThe maximum number of triangles in a \(K_4\)-free graphGraph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.On a Poset of Trees IISome families of graphs with no nonzero real domination rootsNumber of prefixes in trace monoids: clique polynomials and dependency graphsClique polynomials and independent set polynomials of graphsUniversal enveloping algebra of a pair of compatible Lie bracketsOn the independence polynomial of the corona of graphs



Cites Work