Upper bounds for the exponents of pseudo-symmetric graphs

Articles in the same Issue

1. On perfect codes in deletion and insertion metric
2. On the complexity of approximate computation of real numbers by schemes and formulae in different rational bases
3. On regular languages with polynomial growth of the number of words
4. Upper bounds for the exponents of pseudo-symmetric graphs
5. On the relationship between the optima of linear and integer linear programming
6. On the complexity of sorting problem for a Boolean algebra
7. A lower bound for time complexity of the integer problem on uniqueness of elements
8. On sufficient conditions for asymptotic normality of decomposable statistics in a non-homogeneous allocation scheme
9. Sampling sums of dependent random variables, mixtures of infinitely divisible laws and branching random processes