44 search results - page 1 / 9 » The distinguishing number of Cartesian products of complete ... |
84
Voted
EJC
2008
14 years 10 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
2010
14 years 10 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 ...
DM
2008
14 years 10 months ago
2008
SIAMDM
2010
14 years 8 months ago
2010
102
click to vote
GC
2008
Springer
14 years 10 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...