The distinguishing number and distinguishing index of the lexicographic product of two graphs

DOI10.7151/DMGT.2070zbMath1391.05099arXiv1606.08184OpenAlexW2807144296WikidataQ130020392 ScholiaQ130020392MaRDI QIDQ1649920

Samaneh Soltani, Saeid Alikhani

Publication date: 29 June 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.08184

zbMATH Keywords

distinguishing numberlexicographicdistinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Group actions on combinatorial structures (05E18)

Related Items (8)

Number of colors needed to break symmetries of a graph by an arbitrary edge coloring ⋮ The distinguishing number (index) and the domination number of a graph ⋮ Proper distinguishing colorings with few colors for graphs with girth at least 5 ⋮ Distinguishing threshold of graphs ⋮ Distinguishing numbers and distinguishing indices of oriented graphs ⋮ Distinguishing index of Kronecker product of two graphs ⋮ Number of distinguishing colorings and partitions ⋮ The distinguishing number and distinguishing chromatic number for posets

Cites Work

• Distinguishing graphs by edge-colourings
• On the group of the composition of two graphs
• The composition of graphs
• Cartesian powers of graphs can be distinguished by two labels
• Automorphisms of lexicographic products
• Symmetry breaking in graphs
• Distinguishing colorings of Cartesian products of complete graphs
• The distinguishing number of the direct product and wreath product action.
• Distinguishing number and distinguishing index of certain graphs
• The distinguishing index of the Cartesian product of finite graphs

This page was built for publication: The distinguishing number and distinguishing index of the lexicographic product of two graphs