Name
Abstract | ||
|---|---|---|
We consider edge colourings, not necessarily proper. The distinguishing index D' (G) of a graph G is the least number of colours in an edge colouring that is preserved only by the identity automorphism. It is known that D' (G) <= Delta for every countable, connected graph G with finite maximum degree A except for three small cycles. We prove that D' G) <= inverted right perpendicular root Delta inverted left perpendicular + 1 if additionally G does not have pendant edges. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.26493/1855-3974.1852.4f7 | ARS MATHEMATICA CONTEMPORANEA |
Keywords | DocType | Volume |
Symmetry breaking, distinguishing index of a graph | Journal | 18 |
Issue | ISSN | Citations |
1 | 1855-3966 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| W. Imrich | 1 | 64 | 20.65 |
| Rafał Kalinowski | 2 | 48 | 10.75 |
| Monika Pilśniak | 3 | 28 | 9.31 |
| Mariusz Woźniak | 4 | 204 | 34.54 |