Distinguishing number and distinguishing index of strong product of two graphs
From MaRDI portal
Publication:4998754
DOI10.5831/HMJ.2020.42.4.645zbMath1464.05141arXiv1703.01874MaRDI QIDQ4998754
Samaneh Soltani, Saeid Alikhani
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1703.01874
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Distinguishing graphs by edge-colourings
- The distinguishing chromatic number
- Symmetry breaking in graphs
- The distinguishing number of Cartesian products of complete graphs
- Improving upper bounds for the distinguishing index
- Hamilton cycles in strong products of graphs
- The chromatic distinguishing index of certain graphs
- The distinguishing index of the Cartesian product of finite graphs
- The Automorphism Group of a Product of Graphs
- Distinguishing Cartesian powers of graphs
This page was built for publication: Distinguishing number and distinguishing index of strong product of two graphs