Automorphism Breaking of Finite and Inﬁnite Graphs

عنوان به زبان ديگر

پديدآورندگان

Imrich W. imrich@unileoben.ac.at 1Department Mathematics and Information Technology, Montanuniversität Leoben, Austria

تعداد صفحه

4

كليدواژه

Distinguishing number , automorphisms , inﬁnite graphs.

سال انتشار

1396

عنوان كنفرانس

دهمين كنفرانس ملي نظريه گراف و تركيبات جبري

زبان مدرك

انگليسي

چكيده فارسي

This talk surveys results on automorphism breaking of graphs by vertex colorings. It brieﬂy outlines several areas of research and open problems. In particular, it discusses automorphism breaking of vertex transitive graphs, tree-like graphs, graphs of bounded valence, the inﬁnite motion conjecture for locally ﬁnite graphs, graphs of polynomial and subexponential growth, cost and density of 2-distinguishable graphs, products of graphs, uncountable graphs, and probabilistic results.

چكيده لاتين

This talk surveys results on automorphism breaking of graphs by vertex colorings. It brieﬂy outlines several areas of research and open problems. In particular, it discusses automorphism breaking of vertex transitive graphs, tree-like graphs, graphs of bounded valence, the inﬁnite motion conjecture for locally ﬁnite graphs, graphs of polynomial and subexponential growth, cost and density of 2-distinguishable graphs, products of graphs, uncountable graphs, and probabilistic results.

كشور

ايران