Distinguishing Number of Countable Homogeneous Relational Structures


The distinguishing number of a graph G is the smallest positive integer r such that G has a labeling of its vertices with r labels for which there is no non-trivial automorphism of G preserving these labels. In early work, Michael Albertson and Karen Collins computed the distinguishing number for various finite graphs, and more recently Wilfried Imrich… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics