The Distinguishing Chromatic Number of Kneser Graphs

Electronic Journal Of Combinatorics

Zhongyuan Che¹ 

关键词: distinguishing number;    proper coloring;    distinguishing chromatic number;    Kneser graphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A labeling $f: V(G) \rightarrow \{1, 2, \ldots, d\}$ of the vertex set of a graph $G$ is said to be proper $d$-distinguishing if it is a proper coloring of $G$ and any nontrivial automorphism of $G$ maps at least one vertex to a vertex with a different la

【 授权许可】

Others