On distance magic labeling of graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F09%3A00503068" target="_blank" >RIV/49777513:23520/09:00503068 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
On distance magic labeling of graphs
Original language description
Distance magic labeling is a bijection f of V(G) onto {1,2,...,n} with the property that there is a positive integer constant k such that for any vertex x, the sum of f(y) over all neighbors of x equals k. In this paper, we prove new results about the distance magicness of graphs that have minimum degree one or two. Moreover, we construct distance magic labeling for an infinite family of non-regular graphs.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

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

Name of the periodical
Journal of Combinatorial Mathematics and Combinatorial Computing
ISSN
0835-3026
e-ISSN
—
Volume of the periodical
71
Issue of the periodical within the volume
1
Country of publishing house
CA - CANADA
Number of pages
10
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—

Similar results(10)