- Tytuł:
- Trees with Distinguishing Index Equal Distinguishing Number Plus One
- Autorzy:
-
Alikhani, Saeid
Klavžar, Sandi
Lehner, Florian
Soltani, Samaneh - Powiązania:
- https://bibliotekanauki.pl/articles/31804165.pdf
- Data publikacji:
- 2020-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
automorphism group
distinguishing index
distinguishing number
tree
unicyclic graph - Opis:
- 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 which this inequality is sharp. We also show that if G is a connected unicyclic graph, then D′ (G) = D(G).
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2020, 40, 3; 875-884
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł