26 search results - page 1 / 6 » Distinguishing Cartesian powers of graphs |
59
Voted
JGT
2006
14 years 9 months ago
2006
78
Voted
DM
2010
14 years 9 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 ...
80
Voted
EJC
2008
14 years 9 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...
DM
2008
14 years 9 months ago
2008
SIAMDM
2010
14 years 7 months ago
2010