Language: | English |
---|---|
Year of publishing: | 2008 |
Typology: | 0 - Not set |
Organization: | UM FNM - Faculty of Natural Sciences and Mathematics |
UDC: | 519.17 |
COBISS: | 14609753 |
ISSN: | 1318-4865 |
Views: | 750 |
Downloads: | 72 |
Average score: | 0 (0 votes) |
Metadata: |
Secondary language: | Unknown |
---|---|
Secondary title: | Razlikovalno kromatično število kartezičnega produkta dveh polnih grafov |
Secondary abstract: | A labeling of a graph ▫$G$▫ is distinguishing if it is only preserved by the trivial automorphism of ▫$G$▫. The distinguishing chromatic number of ▫$G$▫ is the smallest integer ▫$k$▫ such that ▫$G$▫ has a distinguishing labeling that is at the same time a proper vertex coloring. The distinguishing chromatic number of the Cartesian product $K_k\Box K_n$ is determined for all ▫$k$▫ and ▫$n$▫. In most of the cases it is equal to the chromatic number, thus answering a question of Choi, Hartke and Kaul whether there are some other graphs for which this equality holds. |
Secondary keywords: | teorija grafov;razlikovalno kromatično število;grafovski avtomorfizem;kartezični produkt grafov; |
URN: | URN:SI:UM: |
Type (COBISS): | Not categorized |
Pages: | str. 1-11 |
Volume: | ǂVol. ǂ46 |
Issue: | ǂšt. ǂ1045 |
Chronology: | 2008 |
ID: | 67278 |