Distinguishing index of graphs with simple automorphism groups

DOI10.1016/j.ejc.2021.103414OpenAlexW3195505095MaRDI QIDQ2237852

Andrzej P. Kisielewicz, Grech, Mariusz

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

Mathematics Subject Classification ID

Graph theory (05Cxx) Algebraic combinatorics (05Exx) Permutation groups (20Bxx)

Related Items

Asymmetric edge-colorings of graphs with three colors, Orbit closed permutation groups, relation groups, and simple groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distinguishing graphs by edge-colourings
• Distinguishing numbers for graphs and groups
• Symmetry breaking in graphs
• Distinguishing index of maps
• A bound for the distinguishing index of regular graphs
• Breaking graph symmetries by edge colourings
• The maximum distinguishing number of a group
• Motion and distinguishing number two
• Base size, metric dimension and other invariants of groups and graphs
• On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
• Trivial Set-Stabilizers in Finite Permutation Groups