شماره ركورد كنفرانس :
3806
عنوان مقاله :
Automorphism Breaking of Finite and Infinite Graphs
عنوان به زبان ديگر :
Automorphism Breaking of Finite and Infinite Graphs
پديدآورندگان :
Imrich W. imrich@unileoben.ac.at 1Department Mathematics and Information Technology, Montanuniversität Leoben, Austria
كليدواژه :
Distinguishing number , automorphisms , infinite graphs.
عنوان كنفرانس :
دهمين كنفرانس ملي نظريه گراف و تركيبات جبري
چكيده فارسي :
This talk surveys results on automorphism breaking of graphs by vertex colorings. It briefly 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 infinite motion conjecture for locally finite 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 briefly 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 infinite motion conjecture for locally finite graphs, graphs of polynomial and subexponential growth, cost and density of 2-distinguishable graphs, products of graphs, uncountable graphs, and probabilistic results.
