488 search results - page 5 / 98 » Automorphic Decompositions of Graphs |
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...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
DM
2007
13 years 7 months ago
2007
The correspondence between a (96, 20, 4) symmetric design having regular automorphism group and a difference set with the same parameters has been used to obtain difference sets ...
ICCD
2004
IEEE
14 years 4 months ago
2004
IEEE