Distinguishing Cartesian powers of graphs

DOI10.1002/jgt.20190zbMath1108.05080OpenAlexW4238450335MaRDI QIDQ5898352

Wilfried Imrich, Sandi Klavžar

Publication date: 7 February 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20190

zbMATH Keywords

automorphismdistinguishing number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (32)

Number of colors needed to break symmetries of a graph by an arbitrary edge coloring ⋮ Paint cost and the frugal distinguishing number ⋮ Symmetry parameters of various hypercube families ⋮ Extending precolorings to distinguish group actions ⋮ Distinguishing graphs with intermediate growth ⋮ Distinguishing number and distinguishing index of strong product of two graphs ⋮ Trees with distinguishing number two ⋮ Distinguishing orthogonality graphs ⋮ Distinguishing threshold of graphs ⋮ The distinguishing number of Cartesian products of complete graphs ⋮ Distinguishing numbers and distinguishing indices of oriented graphs ⋮ Improving upper bounds for the distinguishing index ⋮ ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS ⋮ Unnamed Item ⋮ 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 ⋮ 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 ⋮ Asymmetric colorings of products of graphs and digraphs ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture ⋮ Distinguishing chromatic numbers of complements of Cartesian products of complete graphs ⋮ Connectivity of Cartesian products of graphs ⋮ The cost of 2-distinguishing hypercubes ⋮ Distinguishing index of Kronecker product of two graphs ⋮ The determining number of a Cartesian product ⋮ Symmetry parameters for Mycielskian graphs ⋮ Number of distinguishing colorings and partitions ⋮ deBruijn-like sequences and the irregular chromatic number of paths and cycles ⋮ Precise bounds for the distinguishing index of the Cartesian product

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