Distance Magic Graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86098885" target="_blank" >RIV/61989100:27240/16:86098885 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Distance Magic Graphs

Original language description

Let G = (V, E) be a graph of order n. A bijection f : V -> {1, 2, ..., n} is called a distance magic labeling of G if there exists a positive integer k such that SUM(u is an element of N(v)) f(u) = k for all v is an element of V, where N(v) is the open neighborhood of v. The constant k is called the magic constant of the labeling f. Any graph which admits a distance magic labeling is called a distance magic graph. In this paper we present several results on distance magic graphs along with open problems.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2016

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Utilitas Mathematica

ISSN

0315-3681

e-ISSN

—

Volume of the periodical

99

Issue of the periodical within the volume

2016

Country of publishing house

CA - CANADA

Number of pages

12

Pages from-to

131-142

UT code for WoS article

000372853600010

EID of the result in the Scopus database

—