Distinguishing index of graphs with simple automorphism groups

DOI10.1016/J.EJC.2021.103414MaRDI QIDQ2237852zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

• Breaking graph symmetries by edge colourings
• Distinguishing graphs by edge-colourings
• Extremal graphs for the distinguishing index
• The chromatic distinguishing index of certain graphs
• The distinguishing index of connected graphs without pendant edges

Cites work

• scientific article; zbMATH DE number 4081588 (Why is no real title available?)
• scientific article; zbMATH DE number 3747160 (Why is no real title available?)
• scientific article; zbMATH DE number 863496 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• A bound for the distinguishing index of regular graphs
• Base size, metric dimension and other invariants of groups and graphs
• Breaking graph symmetries by edge colourings
• Distinguishing graphs by edge-colourings
• Distinguishing index of maps
• Distinguishing numbers for graphs and groups
• Motion and distinguishing number two
• On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
• Symmetry breaking in graphs
• The maximum distinguishing number of a group
• Trivial Set-Stabilizers in Finite Permutation Groups

Cited in

(9)

• Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
• Breaking graph symmetries by edge colourings
• Orbit closed permutation groups, relation groups, and simple groups
• 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
• Asymmetric edge-coloring of graphs with simple automorphism group
• The chromatic distinguishing index of certain graphs

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)