Name
Abstract | ||
|---|---|---|
The distinguishing number D(G) of a graph G is the smallest number of colors that is needed to color the vertices such that the only color-preserving automorphism fixes all vertices. We give a complete classification for all connected graphs G of maximum valence Delta(G) = 3 and distinguishing number D(G) = 3. As one of the consequences we show that all infinite connected graphs with Delta(G) = 3 are 2-distinguishable. |
Year | Venue | Field |
|---|---|---|
2019 | ELECTRONIC JOURNAL OF COMBINATORICS | Discrete mathematics,Graph,Valence (chemistry),Combinatorics,Automorphism,Mathematics |
DocType | Volume | Issue |
Journal | 26 | 4 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Svenja Hüning | 1 | 0 | 0.34 |
| W. Imrich | 2 | 64 | 20.65 |
| Judith Kloas | 3 | 0 | 0.34 |
| Hannah Schreiber | 4 | 1 | 0.69 |
| Thomas W. Tucker | 5 | 191 | 130.07 |