Name
Abstract | ||
|---|---|---|
The distinguishing index D′(G) of a graph G is the least number of colours needed in an edge colouring which is not preserved by any non-trivial automorphism. Broere and Pilśniak conjectured that if every non-trivial automorphism of a countable graph G moves infinitely many edges, then D′(G)≤2. We prove this conjecture. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.jctb.2017.06.001 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Infinite graphs,Automorphism group,Distinguishing index,Distinguishing number | Graph automorphism,Discrete mathematics,Combinatorics,Edge-transitive graph,Vertex-transitive graph,Gray graph,Semi-symmetric graph,Petersen graph,Symmetric graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
127 | C | 0095-8956 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Florian Lehner | 1 | 21 | 7.24 |