Szczegóły publikacji
Opis bibliograficzny
Note on distance magic products $G \circ C_{4}$ / Marcin Anholcer, Sylwia CICHACZ // Graphs and Combinatorics ; ISSN 0911-0119. — 2015 — vol. 31 iss. 5, s. 1117–1124. — Bibliogr. s. 1124, Abstr.
Autorzy (2)
- Anholcer Marcin
- AGHCichacz-Przeniosło Sylwia
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 93432 |
|---|---|
| Data dodania do BaDAP | 2015-11-04 |
| Tekst źródłowy | URL |
| DOI | 10.1007/s00373-014-1453-x |
| Rok publikacji | 2015 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Graphs and Combinatorics |
Abstract
A distance magic labeling of a graph of order is a bijection with the property that there is a positive integer (called magic constant) such that for every . If a graph admits a distance magic labeling, then we say that is a distance magic graph. In the case of non-regular graph , the problem of determining whether there is a distance magic labeling of the lexicographic product was posted in Arumugam et al. (J Indonesian Math Soc 11-26, 2011). We give necessary and sufficient conditions for the graphs to be distance magic. We also show that the product of the Dutch Windmill Graph and the cycle is not distance magic for any.
