Distance Magic Labeling and Two Products of Graphs

Marcin Anholcer , Sylwia Cichacz , Iztok Peterin , Aleksandra Tepeh


Let G=(V,E) be a graph of order n. A distance magic labeling of G is a bijection ℓ:V→{1,…,n} for which there exists a positive integer k such that ∑x∈N(v)ℓ(x)=k for all v∈V, where N(v) is the neighborhood of v. We introduce a natural subclass of distance magic graphs. For this class we show that it is closed for the direct product with regular graphs and closed as a second factor for lexicographic product with regular graphs. In addition, we characterize distance magic graphs among direct product of two cycles.
Author Marcin Anholcer (WIiGE / KBO)
Marcin Anholcer,,
- Department of Operations Research
, Sylwia Cichacz - AGH University of Science and Technology (AGH)
Sylwia Cichacz,,
, Iztok Peterin - University of Maribor, Slovenia
Iztok Peterin,,
, Aleksandra Tepeh - University of Maribor, Slovenia
Aleksandra Tepeh,,
Journal seriesGraphs and Combinatorics, ISSN 0911-0119, (A 20 pkt)
Issue year2015
Publication size in sheets0.55
Keywords in EnglishDistance magic graphs, Direct product, Lexicographic product
ASJC Classification2607 Discrete Mathematics and Combinatorics; 2614 Theoretical Computer Science
URL https://link.springer.com/content/pdf/10.1007%2Fs00373-014-1455-8.pdf
Languageen angielski
Score (nominal)20
Score sourcejournalList
ScoreMinisterial score = 15.0, 10-01-2020, ArticleFromJournal
Ministerial score (2013-2016) = 20.0, 10-01-2020, ArticleFromJournal
Publication indicators WoS Citations = 4; Scopus SNIP (Source Normalised Impact per Paper): 2015 = 1.217; WoS Impact Factor: 2015 = 0.48 (2) - 2015=0.478 (5)
Citation count*21 (2020-06-13)
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?