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...
| 出版年: | Discussiones Mathematicae Graph Theory |
|---|---|
| 主要な著者: | , , , |
| フォーマット: | 論文 |
| 言語: | 英語 |
| 出版事項: |
University of Zielona Góra
2020-08-01
|
| 主題: | |
| オンライン･アクセス: | https://doi.org/10.7151/dmgt.2162 |