Trees with Distinguishing Index Equal Distinguishing Number Plus One

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) ≤ D(G) + 1. In this note we characterize finite trees for...

Full description

Bibliographic Details
Main Authors: Alikhani Saeid, Klavžar Sandi, Lehner Florian, Soltani Samaneh
Format: Article
Language:English
Published: Sciendo 2020-08-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.2162

Similar Items