Distinguishability of Infinite Groups and Graphs

Electronic Journal Of Combinatorics

Simon M Smith¹ 

关键词: distinguishing number;    primitive permutation group;    primitive graph;    Distinct Spheres Condition;    infinite motion;    Cartesian product of graphs;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The distinguishing number of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The distinguishing number of a graph is the dist

【 授权许可】

Others