Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
EJC
2008
10 years 1 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
DM
2010
117views more  DM 2010»
10 years 1 months ago
The distinguishing chromatic number of Cartesian products of two complete graphs
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 ...
Janja Jerebic, Sandi Klavzar
books