Distinguishability of Infinite Groups and Graphs

[摘要] 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

[学科分类] 离散数学和组合数学

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