Cartesian powers of graphs can be distinguished by two labels
type: Item
instance of: scholarly article
title: Cartesian powers of graphs can be distinguished by two labels
zbMATH Open document ID: 1105.05032
author: Sandi Klavžar
author: Xuding Zhu
published in: European Journal of Combinatorics
publication date: 2006-12-07T00:00:00Z
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 5077707
MaRDI profile type: Publication
full work available at URL: j.ejc.2005.07.001
OpenAlex ID: W2045398969
cites work: Distinguishing Cartesian powers of graphs
cites work: Symmetry breaking in graphs
cites work: The distinguishing number of the hypercube
cites work: Q2716030
cites work: Associative products of graphs
cites work: Q4523707
cites work: A note on the asymptotic and computational complexity of graph distinguishability
cites work: Graph multiplication
DOI: 10.1016/J.EJC.2005.07.001
Recommended article: Distinguishing Cartesian powers of graphs
Recommended article: Q4323316
Recommended article: List distinguishing number of \(p^{\text{th}}\) power of hypercube and Cartesian powers of a graph
Recommended article: Q4550231
Recommended article: Distinguishing Cartesian products of countable graphs
Recommended article: Power domination of the Cartesian product of graphs
Recommended article: Distinguishing numbers of Cartesian products of multiple complete graphs
Recommended article: Graph powers and graph homomorphisms
Recommended article: On the metric dimension of Cartesian powers of a graph
description: scientific article; zbMATH DE number 5077707