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

DOI10.1016/J.EJC.2014.03.012zbMath1300.05135arXiv1309.4020OpenAlexW2027601723MaRDI QIDQ740263

Tomer Kotek, Johann A. Makowsky

Publication date: 2 September 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.4020

zbMATH Keywords

Tutte polynomialindependence polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31)

Related Items (4)

Order bounds for C2-finite sequences ⋮ On the differential polynomial of a graph ⋮ Alliance polynomial of regular graphs ⋮ An extension of holonomic sequences: \(C^2\)-finite sequences

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor invariants for certain subgroups of the orthogonal group
• Non-recursively constructible recursive families of graphs
• The rank of edge connection matrices and the dimension of algebras of invariant tensors
• Algorithmic uses of the Feferman-Vaught theorem
• On the unimodality of independence polynomials of some graphs
• A multivariate interlace polynomial and its computation for graphs of bounded clique-width
• A spanning tree expansion of the Jones polynomial
• Counting permutations with given cycle structure and descent set
• Descent classes of permutations with a given number of fixed points
• Recursively constructible families of graphs
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• Generalized inverses. Theory and applications.
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of graphs
• The colored Jones function is \(q\)-holonomic
• The rank of connection matrices and the dimension of graph algebras
• Approximating clique-width and branch-width
• Recursive families of graphs
• On the set of zero coefficients of a function satisfying a linear differential equation
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Edge coloring models and reflection positivity
• On q-Derangement Numbers
• THE NONCOMMUTATIVE A-IDEAL OF A (2, 2p + 1)-TORUS KNOT DETERMINES ITS JONES POLYNOMIAL
• Finiteness conditions for graph algebras over tropical semirings
• Non-commutative trigonometry and the A-polynomial of the trefoil knot
• Evaluations of Graph Polynomials
• Linear Recurrence Relations for Graph Polynomials

This page was built for publication: Recurrence relations for graph polynomials on bi-iterative families of graphs