Trees with distinguishing index equal distinguishing number plus one

TL;DR

This paper characterizes trees where the distinguishing index equals the distinguishing number plus one and shows that for connected unicyclic graphs, these two parameters are equal.

Contribution

It provides a characterization of trees with the maximum difference between the distinguishing index and number, and establishes equality for connected unicyclic graphs.

Findings

Trees with $D'(G) = D(G) + 1$ are characterized.

For connected unicyclic graphs, $D'(G) = D(G)$ holds.

The inequality $D'(G) leq D(G) + 1$ is sharp for certain trees.

Abstract

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex (edge) labeling with $d$ labels that is preserved only by the trivial automorphism. It is known that for every graph $G$ we have $D'(G) \leq D(G) + 1$. In this note we characterize trees for which this inequality is sharp. We also show that if $G$ is a connected unicyclic graph, then $D'(G) = D(G)$.