Name
Abstract | ||
|---|---|---|
The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism. In this paper we improve results about the distinguishing number of Cartesian products of finite and infinite graphs by removing restrictions to prime or relatively prime factors. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.7151/dmgt.1902 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | Field | DocType |
vertex coloring,distinguishing number,automorphisms,infinite graphs,Cartesian and weak Cartesian product | Discrete mathematics,Product measure,Combinatorics,Countable set,Direct product,Cartesian product,Product (mathematics),Box topology,Product (category theory),Product category,Mathematics | Journal |
Volume | Issue | ISSN |
37 | 1 | 1234-3099 |
Citations | PageRank | References |
3 | 0.47 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ehsan Estaji | 1 | 5 | 1.19 |
| W. Imrich | 2 | 64 | 20.65 |
| Rafał Kalinowski | 3 | 48 | 10.75 |
| Monika Pilśniak | 4 | 28 | 9.31 |
| Thomas W. Tucker | 5 | 191 | 130.07 |