Distinguishing index of graphs with simple automorphism groups
From MaRDI portal
Publication:2237852
DOI10.1016/J.EJC.2021.103414OpenAlexW3195505095MaRDI QIDQ2237852FDOQ2237852
Authors: Mariusz Grech, Andrzej Kisielewicz 
Publication date: 28 October 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.09452
Recommendations
Cites Work
- Title not available (Why is that?)
- Symmetry breaking in graphs
- Base size, metric dimension and other invariants of groups and graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trivial Set-Stabilizers in Finite Permutation Groups
- Distinguishing numbers for graphs and groups
- Motion and distinguishing number two
- Title not available (Why is that?)
- Distinguishing graphs by edge-colourings
- On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
- Breaking graph symmetries by edge colourings
- The maximum distinguishing number of a group
- Distinguishing index of maps
- A bound for the distinguishing index of regular graphs
Cited In (9)
- Breaking graph symmetries by edge colourings
- Orbit closed permutation groups, relation groups, and simple groups
- Asymmetric edge-coloring of graphs with simple automorphism group
- A note on the asymptotic and computational complexity of graph distinguishability
- Extremal graphs for the distinguishing index
- Asymmetric colorings of products of graphs and digraphs
- Asymmetric edge-colorings of graphs with three colors
- The chromatic distinguishing index of certain graphs
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
This page was built for publication: Distinguishing index of graphs with simple automorphism groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237852)
