702 search results - page 1 / 141 » Identifying Graph Automorphisms Using Determining Sets |
COMBINATORICS
2006
13 years 4 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...
COMBINATORICS
2007
13 years 4 months ago
2007
This work introduces the technique of using a carefully chosen determining set to prove the existence of a distinguishing labeling using few labels. A graph G is said to be d-dist...
JCT
2008
13 years 4 months ago
2008
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all t...
JSC
2010
13 years 2 months ago
2010
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
EJC
2008
13 years 4 months ago
2008
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...