Sciweavers

250 search results - page 10 / 50
» Constructing a Class of Symmetric Graphs
Sort
View
ADCM
2010
100views more  ADCM 2010»
13 years 8 months ago
Quasi-interpolatory refinable functions and construction of biorthogonal wavelet systems
We present a new family of compactly supported and symmetric biorthogonal wavelet systems, which extend and unify the Biorthogonal Coifman wavelet system. The refinement mask has ...
Hong Oh Kim, Rae Young Kim, Yeon Ju Lee, Jungho Yo...
CIE
2008
Springer
13 years 10 months ago
Computable Categoricity of Graphs with Finite Components
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu
JCT
2008
103views more  JCT 2008»
13 years 8 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
FUIN
2007
108views more  FUIN 2007»
13 years 8 months ago
Local Properties of Triangular Graphs
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...
Antoni W. Mazurkiewicz
JAPLL
2006
114views more  JAPLL 2006»
13 years 8 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle