On graph invariants given by linear recurrence relations
type: Item
instance of: scholarly article
title: On graph invariants given by linear recurrence relations
zbMATH Open document ID: 0748.05087
DOI: 10.1016/0095-8956(90)90127-L
author: D. N. Yetter
published in: Journal of Combinatorial Theory. Series B
publication date: 1992-06-25T00:00:00Z
review text: It has been shown that ``a family of directed rewrite rules is sufficient to demonstrate the existence of an \(R\)-values invariant of objects in \(C\) modulo the given equivalence and defined by the given linear recurrence relations under certain conditions''. The paper is concluded by some important open problems.
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 4362
zbMATH Keywords: graph invariants
zbMATH Keywords: linear recurrence relations
reviewed by: B. M. Agrawal
MaRDI profile type: Publication
cites work: Q4154891
cites work: Approximations for chromatic polynomials
cites work: Some Properties of Conversion
cites work: A new polynomial invariant of knots and links
cites work: Generalized chromatic polynomials
cites work: Q5581665
cites work: On theories with a combinatorial definition of 'equivalence'
cites work: Q4135576
cites work: Q5788382
cites work: Q3216652
full work available at URL: 0095-8956(90)90127-l
OpenAlex ID: W1990884041
description: scientific article; zbMATH DE number 4362