Infinite graphs with finite 2-distinguishing cost

zbMATH Open1305.05163MaRDI QIDQ490268FDOQ490268

Authors: 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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Bounds for distinguishing invariants of infinite graphs
• Distinguishing infinite graphs
• Distinguishing infinite graphs with bounded degrees
• The distinguishing index of infinite graphs
• The optimal general upper bound for the distinguishing index of infinite graphs
• The complexity of a class of infinite graphs
• Infinite graphs with finite dominating sets
• On disjoint configurations in infinite graphs
• Publication:3204497
• Distinguishing homomorphisms of infinite graphs

zbMATH Keywords

automorphismdetermining setdetermining numberdistinguishabilitydistinguishing number

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Connectivity (05C40) Infinite graphs (05C63)

Cites Work

• Symmetry breaking in graphs
• Chains of subgroups in symmetric groups
• Identifying graph automorphisms using determining sets
• Distinguishing graphs with infinite motion and nonlinear growth
• Automorphisms and endomorphisms of infinite locally finite graphs
• The cost of 2-distinguishing selected Kneser graphs and hypercubes
• Small label classes in 2-distinguishing labelings
• Using determining sets to distinguish Kneser graphs

Cited In (12)

• The cost of 2-distinguishing selected Kneser graphs and hypercubes
• The cost of distinguishing graphs
• Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density
• A note on the asymptotic and computational complexity of graph distinguishability
• The cost number and the determining number of a graph
• Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
• Random colourings and automorphism breaking in locally finite graphs
• Small label classes in 2-distinguishing labelings
• On a theorem of Halin
• The cost of 2-distinguishing Cartesian powers
• Distinguishing graphs with intermediate growth
• Distinguishing density and the distinct spheres condition

This page was built for publication: Infinite graphs with finite 2-distinguishing cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490268)