Edge motion and the distinguishing index
From MaRDI portal
Publication:526904
DOI10.1016/J.TCS.2017.02.032zbMath1369.05084OpenAlexW2606349845MaRDI QIDQ526904
Publication date: 15 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.02.032
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Distinguishing index of Kronecker product of two graphs ⋮ The distinguishing number and distinguishing chromatic number for posets ⋮ The distinguishing index of infinite graphs
Cites Work
- Distinguishing graphs by edge-colourings
- A note on the asymptotic and computational complexity of graph distinguishability
- Symmetry breaking in graphs
- The distinguishing index of infinite graphs
- SELF-STABILIZING MASTER–SLAVE TOKEN CIRCULATION AND EFFICIENT SIZE-COMPUTATION IN A UNIDIRECTIONAL RING OF ARBITRARY SIZE
- The distinguishing index of the Cartesian product of finite graphs
- The Automorphism Group of a Product of Graphs
- Near Optimal Leader Election in Multi-Hop Radio Networks
- Distinguishing Cartesian powers of graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Edge motion and the distinguishing index