Name
Abstract | ||
|---|---|---|
We determine the values of s and t for which there is a coloring of the edges of the complete bipartite graph K\"s\",\"t which admits only the identity automorphism. In particular, this allows us to determine the distinguishing number of the Cartesian product of complete graphs. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.04.070 | Discrete Mathematics |
Keywords | Field | DocType |
distinguishing number,automorphism,edge coloring,complete graph,complete bipartite graph | Edge coloring,Discrete mathematics,Complete graph,Complete coloring,Complete bipartite graph,Combinatorics,Cartesian product,Graph product,Greedy coloring,1-planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 11 | Discrete Mathematics |
Citations | PageRank | References |
14 | 0.98 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Fisher | 1 | 96 | 7.91 |
| Garth Isaak | 2 | 172 | 24.01 |