Infinite graphs with finite 2-distinguishing cost
From MaRDI portal
Publication:490268
zbMath1305.05163MaRDI QIDQ490268
Wilfried Imrich, Debra L. Boutin
Publication date: 22 January 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p52
Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Infinite graphs (05C63)
Related Items
Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ On a theorem of Halin ⋮ Distinguishing density and the distinct spheres condition
Cites Work
- Unnamed Item
- Identifying graph automorphisms using determining sets
- Using determining sets to distinguish Kneser graphs
- Chains of subgroups in symmetric groups
- Symmetry breaking in graphs
- Automorphisms and endomorphisms of infinite locally finite graphs
- Distinguishing graphs with infinite motion and nonlinear growth
- Small label classes in 2-distinguishing labelings