QR Code

Union of Distance Magic Graphs

A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant. In this paper, we study unions of distance magic graphs as well as...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Cichacz Sylwia, Nikodem Mateusz
Format: Artigo
Langue:Inglês
Publié: University of Zielona Góra 2017-02-01
Collection:Discussiones Mathematicae Graph Theory
Sujets:
Accès en ligne:https://doi.org/10.7151/dmgt.1932
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!