Distance magic labeling and two products of graphs

DOI10.1007/S00373-014-1455-8MaRDI QIDQ497299zbMATH OpenOpenAlexWikidataFDO

Authors Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh

Publication date 24 September 2015

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1210.1836

zbMATH Keywords

direct productdistance magic graphslexicographic product

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is a bijection $ellcolonVightarrow1,\mathrm{...},n$ for which there exists a positive integer $k$ such that $su{m}_{xinN(v)}ell(x)=k$ for all $vinV$, 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.

Recommendations

• Group distance magic labeling of direct product of graphs
• On distance magic labeling of graphs
• Distance magic graphs \(G \times C_n\)
• Note on distance magic products G C₄
• Distance magic graphs

Cites work

• A worthy family of semisymmetric graphs
• Distance magic circulant graphs
• Fair incomplete tournaments
• scientific article; zbMATH DE number 139936 (Why is no real title available?)
• scientific article; zbMATH DE number 1998306 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 6273983 (Why is no real title available?)
• scientific article; zbMATH DE number 3358515 (Why is no real title available?)
• Note on group distance magic graphs \(G[C_4]\)
• On \(\Sigma\) and \(\Sigma'\) labelled graphs
• Sigma graphs: a survey
• The Kronecker Product of Graphs

Cited in

(17)

• Constant sum partition of sets of integers and distance magic graphs
• On distance magic circulants of valency 6
• Distance magic labeling of the halved folded \(n\)-cube
• Distance magic Cartesian products of graphs
• Spectra of graphs and closed distance magic labelings
• Distance magic labeling in complete 4-partite graphs
• Group distance magic labeling of direct product of graphs
• Note on distance magic products G C₄
• Note on group distance magicness on product graphs
• Union of distance magic graphs
• Orientable \(\mathbb Z_n\)-distance magic graphs via products
• On closed distance magic circulants of valency up to 5
• Distance magic labeling of the halved folded \(n\)-cube
• Distance magic labelings of Cartesian products of cycles
• Self-reverse labelings of distance magic graphs
• Tetravalent distance magic graphs of small order and an infinite family of examples
• Note on the group distance magic labeling of direct product of two cycles

This page was built for publication: Distance magic labeling and two products of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497299)