Cartesian powers of graphs can be distinguished by two labels

DOI10.1016/J.EJC.2005.07.001MaRDI QIDQ854831zbMATH OpenOpenAlexFDO

Authors Sandi Klavžar, Xuding Zhu

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

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs
• scientific article; zbMATH DE number 723367
• List distinguishing number of \(p^{\text{th}}\) power of hypercube and Cartesian powers of a graph
• scientific article; zbMATH DE number 1787227
• Distinguishing Cartesian products of countable graphs
• Power domination of the Cartesian product of graphs
• Distinguishing numbers of Cartesian products of multiple complete graphs
• Graph powers and graph homomorphisms
• On the metric dimension of Cartesian powers of a graph

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• A note on the asymptotic and computational complexity of graph distinguishability
• Associative products of graphs
• Distinguishing Cartesian powers of graphs
• Graph multiplication
• Symmetry breaking in graphs
• The distinguishing number of the hypercube

Cited in

(28)

• Distinguishing number and distinguishing index of neighbourhood corona of two graphs
• Symmetry parameters of various hypercube families
• Distinguishing number and distinguishing index of natural and fractional powers of graphs
• Distinguishing colorings of Cartesian products of complete graphs
• Distinguishing numbers and distinguishing indices of oriented graphs
• 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
• Distinguishing number and distinguishing index of certain graphs
• The distinguishing number of the augmented cube and hypercube powers
• Precise bounds for the distinguishing index of the Cartesian product
• The distinguishing number of Cartesian products of complete graphs
• List distinguishing number of \(p^{\text{th}}\) power of hypercube and Cartesian powers of a graph
• Paint cost and the frugal distinguishing number
• The cost of 2-distinguishing Cartesian powers
• Distinguishing Cartesian products of countable graphs
• The list distinguishing number equals the distinguishing number for interval graphs
• Symmetry parameters for Mycielskian graphs
• Infinite motion and 2-distinguishability of graphs and groups
• The list distinguishing number of Kneser graphs
• Distinguishing graphs with intermediate growth
• The distinguishing number and distinguishing index of the lexicographic product of two graphs
• Automorphisms and distinguishing numbers of geometric cliques
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs
• Distinguishing orthogonality graphs
• List-distinguishing Cartesian products of cliques
• Distinguishing generalized Mycielskian graphs

This page was built for publication: Cartesian powers of graphs can be distinguished by two labels

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