Distance Magic Cartesian Products of Graphs
A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant.
Na minha lista:
| Principais autores: | , , , |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
University of Zielona Góra
2016-05-01
|
| 叢編: | Discussiones Mathematicae Graph Theory |
| 主題: | |
| 在線閱讀: | https://doi.org/10.7151/dmgt.1852 |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|