Infinite Graphs with Finite 2-Distinguishing Cost

Electronic Journal Of Combinatorics

Debra Boutin¹ 

关键词: Distinguishing number;    Distinguishability;    Automorphism;    Determining set;    Determining number;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A graph $G$ is said to be 2-distinguishable if there is a labeling of the vertices with two labels such that only the trivial automorphism preserves the labels. Call the minimum size of a label class in such a labeling of $G$ the cost of 2-distinguishing

【 授权许可】

Others