Clique polynomials and independent set polynomials of graphs
From MaRDI portal
Publication:1322274
DOI10.1016/0012-365X(94)90163-5zbMath0799.05030OpenAlexW2082864800MaRDI QIDQ1322274
Publication date: 5 May 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)90163-5
Related Items (79)
Clique cover products and unimodality of independence polynomials ⋮ A new approach for the numerical solution for nonlinear Klein-Gordon equation ⋮ Rings of graphs ⋮ Distinctive power of the alliance polynomial for regular graphs ⋮ Analytic properties of sextet polynomials of hexagonal systems ⋮ Graph products of the trivariate total domination polynomial and related polynomials ⋮ A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems ⋮ Inclusion-exclusion by ordering-free cancellation ⋮ CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS ⋮ Unimodality of independence polynomials of the incidence product of graphs ⋮ Building graphs whose independence polynomials have only real roots ⋮ On the dependence polynomial of a graph ⋮ A survey on recurrence relations for the independence polynomial of hypergraphs ⋮ On the location of roots of independence polynomials ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ A Study on Homotopy Analysis Method and Clique Polynomial Method ⋮ The roots of the independence polynomial of a clawfree graph ⋮ On the unimodality of independence polynomials of some graphs ⋮ A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs ⋮ Unimodality of independence polynomials of the cycle cover product of graphs ⋮ Bears with hats and independence polynomials ⋮ Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts ⋮ Farrell polynomials on graphs of bounded tree width ⋮ Co-2-plex polynomials ⋮ CONNECTED COMMON NEIGHBORHOOD SYSTEMS OF CLIQUES IN A GRAPH: A POLYNOMIAL REPRESENTATION ⋮ INDUCED CYCLE POLYNOMIAL OF A GRAPH ⋮ Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs ⋮ Hilbert series and suspensions of graphs ⋮ Independence polynomials of some compound graphs ⋮ POLYNOMIAL REPRESENTATIONS OF THE BICLIQUE NEIGHBORHOOD OF GRAPHS ⋮ FROM GRAPHS TO POLYNOMIAL RINGS: STAR POLYNOMIAL REPRESENTATION OF GRAPHS ⋮ CONVEX INDEPENDENT COMMON NEIGHBORHOOD POLYNOMIAL OF A GRAPH ⋮ CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS ⋮ STAR POLYNOMIAL OF THE CORONA OF GRAPHS ⋮ INDUCED PATH POLYNOMIAL OF GRAPHS ⋮ On the unimodality of independence polynomials of very well-covered graphs ⋮ General position polynomials ⋮ The cyclomatic number of a graph and its independence polynomial at \(- 1\) ⋮ Some results on the independence polynomial of unicyclic graphs ⋮ A way to construct independence equivalent graphs ⋮ Shearer's measure and stochastic domination of product measures ⋮ Unnamed Item ⋮ Fair cost allocations under conflicts - a game-theoretic point of view - ⋮ The zero forcing polynomial of a graph ⋮ On the differential polynomial of a graph ⋮ Independence equivalence classes of cycles ⋮ Independent vertex sets in the Zykov sum ⋮ On the roots of independence polynomials of almost all very well-covered graphs ⋮ The Merrifield–Simmons Conjecture Holds for Bipartite Graphs ⋮ Alliance polynomial of regular graphs ⋮ The independence polynomial of rooted products of graphs ⋮ Log-concavity of independence polynomials of some kinds of trees ⋮ Independence roots and independence fractals of certain graphs ⋮ Extremal phenylene chains with respect to the coefficients sum of the permanental polynomial, the spectral radius, the Hosoya index and the Merrifield-Simmons index ⋮ The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma ⋮ Independence polynomials of \(k\)-tree related graphs ⋮ Average independence polynomials ⋮ On the coefficients of the independence polynomial of graphs ⋮ Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture ⋮ A logician's view of graph polynomials ⋮ On the Fibonacci numbers of the composition of graphs ⋮ Numerical-solution-for-nonlinear-Klein-Gordon equation via operational-matrix by clique polynomial of complete graphs ⋮ Exponential Time Complexity of Weighted Counting of Independent Sets ⋮ On the location of roots of graph polynomials ⋮ A unified approach to the first derivatives of graph polynomials ⋮ From a zoo to a zoology: Towards a general theory of graph polynomials ⋮ INDEPENDENCE AND PI POLYNOMIALS FOR FEW STRINGS ⋮ Semantic Equivalence of Graph Polynomials Definable in Second Order Logic ⋮ Cluj polynomials ⋮ Omega polynomial and its use in nanostructure description ⋮ Algorithms for the fixed point property ⋮ Roots of independence polynomials of well covered graphs ⋮ Reconstructing subgraph-counting graph polynomials of increasing families of graphs ⋮ Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems. ⋮ Unnamed Item ⋮ Independence polynomials of bipartite graphs ⋮ Independence equivalence classes of paths ⋮ Bipartition polynomials, the Ising model, and domination in graphs ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- An introduction to matching polynomials
- On the numbers of independent \(k\)-sets in a claw free graph
- Dependence polynomials
- On the theory of the matching polynomial
- Matchings and walks in graphs
- The Number of Words of Length n in a Graph Monoid
- Hard graphs for the maximum clique problem
This page was built for publication: Clique polynomials and independent set polynomials of graphs
