Sciweavers

Share
718 search results - page 1 / 144
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
9 years 11 months ago
Identifying Graph Automorphisms Using Determining Sets
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...
Debra L. Boutin
COMBINATORICS
2007
73views more  COMBINATORICS 2007»
9 years 11 months ago
Using Determining Sets to Distinguish Kneser Graphs
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...
Michael O. Albertson, Debra L. Boutin
JSC
2010
132views more  JSC 2010»
9 years 10 months ago
Binary codes from the line graph of the n-cube
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...
W. Fish, Jennifer D. Key, E. Mwambene
JCT
2008
71views more  JCT 2008»
9 years 11 months ago
Primitive decompositions of Johnson graphs
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...
Alice Devillers, Michael Giudici, Cai Heng Li, Che...
EJC
2008
9 years 12 months ago
The distinguishing number of Cartesian products of complete graphs
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...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
books