Distinguishing Cartesian powers of graphs

DOI10.1002/JGT.20190zbMATH Open1108.05080OpenAlexW4238450335MaRDI QIDQ5898352FDOQ5898352

Authors: 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

Recommendations

• Cartesian powers of graphs can be distinguished by two labels
• Distinguishing Cartesian powers of graphs
• List distinguishing number of \(p^{\text{th}}\) power of hypercube and Cartesian powers of a graph
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing Cartesian products of countable graphs

zbMATH Keywords

automorphismdistinguishing number

Mathematics Subject Classification ID

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

Cited In (43)

• Extending precolorings to distinguish group actions
• Distinguishing index of Kronecker product of two graphs
• Distinguishing number and distinguishing index of strong product of two graphs
• Symmetry parameters of various hypercube families
• Distinguishing number and distinguishing index of natural and fractional powers of graphs
• Transitive coloring of graphs
• Distinguishing colorings of Cartesian products of complete graphs
• Distinguishing numbers and distinguishing indices of oriented graphs
• Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
• 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 threshold of graphs
• The cost of 2-distinguishing hypercubes
• Trees with distinguishing number two
• The distinguishing number of the augmented cube and hypercube powers
• Precise bounds for the distinguishing index of the Cartesian product
• ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
• The distinguishing number of Cartesian products of complete graphs
• Game distinguishing numbers of Cartesian products
• The determining number of a Cartesian product
• Number of distinguishing colorings and partitions
• List distinguishing number of \(p^{\text{th}}\) power of hypercube and Cartesian powers of a graph
• On the distinguishing chromatic number of the Kronecker products of graphs
• Improving upper bounds for the distinguishing index
• deBruijn-like sequences and the irregular chromatic number of paths and cycles
• Paint cost and the frugal distinguishing number
• Connectivity of Cartesian products of graphs
• The cost of 2-distinguishing Cartesian powers
• Symmetry parameters for Mycielskian graphs
• Distinguishing Cartesian products of countable graphs
• The list distinguishing number equals the distinguishing number for interval graphs
• Distinguishing graphs with intermediate growth
• The distinguishing number of the hypercube
• Distinguishing Cartesian powers of graphs
• Automorphisms and distinguishing numbers of geometric cliques
• Cartesian powers of graphs can be distinguished by two labels
• Distinguishing orthogonality graphs
• Title not available (Why is that?)
• The distinguishing index of the Cartesian product of finite graphs
• Distinguishing generalized Mycielskian graphs
• Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
• The number of distinguishing colorings of a Cartesian product graph

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

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