In this paper we introduce, and characterize, a class of graph parameters obtained from tensor invariants of the symplectic group. These parameters are similar to partition functions of vertex models, as introduced by de la Harpe and Jones (1993) [5]. Yet they give a completely different class of graph invariants. We moreover show that certain evaluations of the cycle partition polynomial, as defined by Martin (1977) [15], give examples of graph parameters that can be obtained this way
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
ABSTRACT In this paper the independence numbers and algebraic properties of graph invariant has bee...
This thesis introduces a novel way of writing polynomial invariants as network graphs, and applies t...
We introduce a new class of graph parameters coming from invariants of the orthosymplectic group, wh...
This thesis is concerned with links between certain graph parameters and the invariant theory of the...
We characterize which graph parameters are partition functions of a vertex model over an algebraical...
Let V be an n-dimensional vector space, and let O n be the orthogonal group. Motivated by a question...
A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it spe...
AbstractSpin models and vertex models on graphs are defined as appropriate generalizations of the Is...
Spin models and vertex models on graphs are defined as appropriate generalizations of the Ising-Pott...
Symmetric graphs have non-trivial automorphism groups. This article starts with the proof that all p...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
ABSTRACT In this paper the independence numbers and algebraic properties of graph invariant has bee...
This thesis introduces a novel way of writing polynomial invariants as network graphs, and applies t...
We introduce a new class of graph parameters coming from invariants of the orthosymplectic group, wh...
This thesis is concerned with links between certain graph parameters and the invariant theory of the...
We characterize which graph parameters are partition functions of a vertex model over an algebraical...
Let V be an n-dimensional vector space, and let O n be the orthogonal group. Motivated by a question...
A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it spe...
AbstractSpin models and vertex models on graphs are defined as appropriate generalizations of the Is...
Spin models and vertex models on graphs are defined as appropriate generalizations of the Ising-Pott...
Symmetric graphs have non-trivial automorphism groups. This article starts with the proof that all p...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
ABSTRACT In this paper the independence numbers and algebraic properties of graph invariant has bee...
This thesis introduces a novel way of writing polynomial invariants as network graphs, and applies t...