Photo from wikipedia
Abstract The distinguishing index D ′ ( Γ ) of a graph Γ is the least number k such that Γ has an edge-coloring with k colors preserved only by… Click to show full abstract
Abstract The distinguishing index D ′ ( Γ ) of a graph Γ is the least number k such that Γ has an edge-coloring with k colors preserved only by the trivial automorphism. In this paper we prove that if the automorphism group of a finite graph Γ is simple, then its distinguishing index D ′ ( Γ ) = 2 .
Keywords:
index;
index graphs;
distinguishing index;
simple automorphism;
graphs simple
Journal Title: European Journal of Combinatorics
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: European Journal of Combinatorics
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!