Local distinguishing numbers of trees (1998) [1 citations — 0 self]
by Christine T. Cheng
Proc. Twenty-ninth SE Internatl. Conf. Combinatorics, Graph Theory and Computing) (Boca
http://www.mts.jhu.edu/~cheng/congressus2.ps
Add To MetaCart
Abstract:
The i-local distinguishing number of G, denoted by LD i (G), was defined in [3]. Let T be a tree on n? 2 vertices with maximum degree bounded by some constant k. It is shown that LD 1
Citations
| 18 | Symmetry Breaking in Graphs, Electron – Albertson, Collins - 1996 |
| 1 | An Algorithm for Determining Distinguishing Numbers of Trees Unpublished manuscript – Cheng |
| 1 | On Local Distinguishing – Cheng, Cowen |
