Recurrence relations for graph polynomials on bi-iterative families of graphs

@article{Kotek2014RecurrenceRF,
  title={Recurrence relations for graph polynomials on bi-iterative families of graphs},
  author={Tomer Kotek and Johann A. Makowsky},
  journal={Eur. J. Comb.},
  year={2014},
  volume={41},
  pages={47-67}
}
On the Differential Polynomial of a Graph
We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial
Simple C-finite Sequences: a Computable Generalization of C-finite Sequences
TLDR
The class of simple C-finite sequences is defined and it is shown that it satisfies the same computational properties, but does not share the same technical issues.
Alliance polynomial of regular graphs
On C2-finite Sequences
TLDR
This paper shows that C2-finite sequences form a difference ring and provide methods to compute in this ring and investigates the set of sequences which satisfy linear recurrence equations with coefficients that are C-finitely sequences.
An extension of holonomic sequences: C-finite sequences
Holonomic sequences are widely studied as many objects interesting to mathematicians and computer scientists are in this class. In the univariate case, these are the sequences satisfying linear
Ansatz in a Nutshell: A comprehensive step-by-step guide to polynomial, $C$-finite, holonomic, and $C^2$-finite sequences
Given a sequence 1, 1, 5, 23, 135, 925, 7285, 64755, 641075, 6993545, 83339745,..., how can we guess a formula for it? This article will quickly walk you through the concept of ansatz for classes of
Ansatz in a Nutshell
Given a sequence 1, 1, 5, 23, 135, 925, 7285, 64755, 641075, 6993545, 83339745,..., how can we guess a formula for it? This article will quickly walk you through the concept of ansatz for classes of

References

SHOWING 1-10 OF 36 REFERENCES
Recursive families of graphs
Recursively constructible families of graphs
Linear Recurrence Relations for Graph Polynomials
TLDR
It is shown that linear recurrences with polynomial coefficients for a wide class of graph polynomials (also of labeled or signed graphs), namely they hold for all the extended MSOL-definable graph poynomials, include most graph and knot polynmials studied in the literature.
Evaluations of Graph Polynomials
TLDR
A sufficient condition in terms of the connection matrix of graph parameter f (G) is given which implies that it cannot be the evaluation of any graph polynomial which is invariantly definable in CMSOL, the Monadic Second Order Logic augmented with modular counting quantifiers.
The unimodality of independence polynomials of some graphs
Finiteness Conditions for Graph Algebras over Tropical Semirings
TLDR
It is shown that rank-finiteness of join matrices implies that these graph parameters can be computed in polynomial time on graph classes of bounded clique-width, and that rank finiteness is a much weaker assumption than any definability assumption.
Reflection positivity, rank connectivity, and homomorphism of graphs
It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection positivity and
The independence polynomial of a graph - a survey
A stable (or independent) set in a graph is a set of pairwise non-adjacent vertices. The stability number fi(G) is the size of a maximum stable set in the graph G. There are three dierent kinds of
A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width
We define a multivariate polynomial that generalizes in a unified way the two-variable interlace polynomial defined by Arratia, Bollobas and Sorkin on the one hand, and a one-variable variant of it
Upper bounds to the clique width of graphs
...
...