Join Our Newsletter

718 search results - page 1 / 144» Identifying Graph Automorphisms Using Determining Sets |

COMBINATORICS

2006

9 years 11 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

9 years 11 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...

JSC

2010

9 years 10 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 ﬁnd the automorphism groups and the parameters of the cod...

JCT

2008

9 years 11 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...

EJC

2008

9 years 12 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...