88 search results - page 7 / 18 » Computing automorphisms of semigroups |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
GC
2006
Springer
13 years 7 months ago
2006
Springer
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
We present two families of constacyclic linear codes with large automorphism groups. The codes are obtained from the twisted tensor product construction. AMS subject classificatio...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
A simple replacement approach is used to construct new symmetric and affine designs from projective or affine spaces. This is used to construct symmetric designs with a given autom...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...