751 search results - page 1 / 151 » The Distinguishing Chromatic Number |
104
Voted
DM
2010
15 years 23 days 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 ...
59
Voted
COMBINATORICS
2006
15 years 22 days ago
2006
82
Voted
SIAMDM
2010
14 years 11 months ago
2010
100
Voted
JCT
2008
15 years 20 days ago
2008
Let T be an unrooted tree. The chromatic symmetric function XT , introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of T . The subtre...
74
Voted
COMBINATORICS
2007
15 years 20 days ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...