Distinguishing Cartesian powers of graphs

zbMath1082.05047MaRDI QIDQ5921670

Michael O. Albertson

Publication date: 1 November 2005

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/125633

zbMATH Keywords

labelingCartesian product\(d\)-distinguishing number

Mathematics Subject Classification ID

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

Related Items (23)

Paint cost and the frugal distinguishing number ⋮ Symmetry parameters of various hypercube families ⋮ Effective storage capacity of labeled graphs ⋮ Extending precolorings to distinguish group actions ⋮ Cartesian powers of graphs can be distinguished by two labels ⋮ Distinguishing orthogonality graphs ⋮ List-distinguishing Cartesian products of cliques ⋮ The distinguishing number of Cartesian products of complete graphs ⋮ Distinguishing numbers and distinguishing indices of oriented graphs ⋮ Automorphisms and distinguishing numbers of geometric cliques ⋮ Distinguishing Cartesian products of countable graphs ⋮ The list distinguishing number equals the distinguishing number for interval graphs ⋮ Edge motion and the distinguishing index ⋮ Distinguishing Generalized Mycielskian Graphs ⋮ Infinite motion and 2-distinguishability of graphs and groups ⋮ Distinguishing colorings of Cartesian products of complete graphs ⋮ The distinguishing chromatic number of Cartesian products of two complete graphs ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture ⋮ Distinguishing chromatic numbers of complements of Cartesian products of complete graphs ⋮ The cost of 2-distinguishing hypercubes ⋮ Symmetry parameters for Mycielskian graphs ⋮ On the distinguishing number of functigraphs ⋮ Distinguishing number and distinguishing index of certain graphs

This page was built for publication: Distinguishing Cartesian powers of graphs