Cartesian powers of graphs can be distinguished by two labels
From MaRDI portal
Publication:854831
DOI10.1016/j.ejc.2005.07.001zbMath1105.05032OpenAlexW2045398969MaRDI QIDQ854831
Publication date: 7 December 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.07.001
Related Items (23)
Paint cost and the frugal distinguishing number ⋮ Symmetry parameters of various hypercube families ⋮ The distinguishing number and distinguishing index of the lexicographic product of two graphs ⋮ Distinguishing graphs with intermediate growth ⋮ Distinguishing orthogonality graphs ⋮ List-distinguishing Cartesian products of cliques ⋮ The list distinguishing number of Kneser graphs ⋮ 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 ⋮ Distinguishing Generalized Mycielskian Graphs ⋮ Infinite motion and 2-distinguishability of graphs and groups ⋮ Distinguishing colorings of Cartesian products of complete graphs ⋮ The distinguishing number of the augmented cube and hypercube powers ⋮ The distinguishing chromatic number of Cartesian products of two complete graphs ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture ⋮ The cost of 2-distinguishing hypercubes ⋮ Symmetry parameters for Mycielskian graphs ⋮ Distinguishing number and distinguishing index of neighbourhood corona of two graphs ⋮ Distinguishing number and distinguishing index of certain graphs ⋮ Precise bounds for the distinguishing index of the Cartesian product
Cites Work
This page was built for publication: Cartesian powers of graphs can be distinguished by two labels
