68 search results - page 4 / 14 » Symplectic graphs and their automorphisms |
COMBINATORICS
2006
13 years 7 months ago
2006
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...
DLT
2010
13 years 8 months ago
2010
Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in...
EJC
2010
13 years 7 months ago
2010
Two different constructions are given of a rank 8 arc-transitive graph with 165 vertices and valency 8, whose automorphism group
DM
2010
13 years 7 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 ...
GC
2007
Springer
13 years 7 months ago
2007
Springer
Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle C of Γ is called G-consistent whenever there is an element of G whose restri...