19 search results - page 1 / 4 » Linear Recurrence Relations for Graph Polynomials |
BIRTHDAY
2008
Springer
13 years 6 months ago
2008
Springer
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
NA
2010
13 years 3 months ago
2010
Abstract: In this work we give an interpretation of a (s(d + 1) + 1)-term recurrence relation in terms of type II multiple orthogonal polynomials. We rewrite this recurrence relati...
SIAMDM
2002
13 years 4 months ago
2002
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
STRINGOLOGY
2008
13 years 6 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...