The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism. The lexicographic product of two graphs G and H, G[H] can be obtained from G by substituting a copy H...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
University of Zielona Góra
2018-08-01
|
| Serier: | Discussiones Mathematicae Graph Theory |
| Fag: | |
| Online adgang: | https://doi.org/10.7151/dmgt.2070 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|