Name
Abstract | ||
|---|---|---|
We introduce the distinguishing index D′(G) of a graph G as the least number d such that G has an edge-colouring with d colours that is only preserved by the trivial automorphism. This is an analog to the notion of the distinguishing number D(G) of a graph G, which is defined for colourings of vertices. We obtain a general upper bound D′(G)≤Δ(G) unless G is a small cycle C3, C4 or C5. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ejc.2014.11.003 | European Journal of Combinatorics |
Field | DocType | Volume |
Discrete mathematics,Edge coloring,Graph,Combinatorics,Edge-transitive graph,Vertex (geometry),Graph power,Bound graph,Automorphism,Upper and lower bounds,Mathematics | Journal | 45 |
ISSN | Citations | PageRank |
0195-6698 | 1 | 0.38 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafał Kalinowski | 1 | 48 | 10.75 |
| Monika Pilsniak | 2 | 29 | 5.42 |