61 search results - page 11 / 13 » dm 2000 |
DM
2010
14 years 9 months ago
2010
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
DM
2008
14 years 9 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
DM
2000
14 years 9 months ago
2000
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
DM
2000
14 years 9 months ago
2000
The transformation which assigns to a linear operator L the recurrence satisfied by coefficient sequences of the polynomial series in its kernel, is shown to be an isomorphism of ...
DM
2006
14 years 9 months ago
2006
Pattern Sturmian words introduced by Kamae and Zamboni KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two k...