The cost of 2-distinguishing Cartesian powers

zbMath1266.05138MaRDI QIDQ1953468

Debra L. Boutin

Publication date: 7 June 2013

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/v20i1p74

zbMATH Keywords

Cartesian productdetermining numbergraph distinguishing

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (8)

Paint cost and the frugal distinguishing number ⋮ Symmetry parameters of various hypercube families ⋮ Improving upper bounds for the distinguishing index ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture ⋮ Distinguishing graphs of maximum valence 3 ⋮ The cost of 2-distinguishing hypercubes ⋮ Symmetry parameters for Mycielskian graphs ⋮ The distinguishing number and distinguishing chromatic number for posets

This page was built for publication: The cost of 2-distinguishing Cartesian powers