3 search results - page 1 / 1 » On distinguishing trees by their chromatic symmetric functio... |
JCT
2008
14 years 11 months 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...
68
Voted
COMBINATORICS
2007
14 years 11 months 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 ...
ACSAC
2009
IEEE
15 years 5 months ago
2009
IEEE
To protect privacy in large systems, users must be able to authenticate against a central server without disclosing their identity to the network. Private identification protocols ...