Distance magic labeling and two products of graphs

DOI10.1007/S00373-014-1455-8zbMATH Open1327.05296arXiv1210.1836OpenAlexW2051761578WikidataQ59408368 ScholiaQ59408368MaRDI QIDQ497299FDOQ497299

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

Publication date: 24 September 2015

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

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.

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

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\circ C_4\)
• Distance magic graphs

zbMATH Keywords

direct productlexicographic productdistance magic graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On \(\Sigma\) and \(\Sigma'\) labelled graphs
• The Kronecker Product of Graphs
• Sigma graphs: a survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distance magic circulant graphs
• Title not available (Why is that?)
• Note on group distance magic graphs \(G[C_4]\)
• Fair incomplete tournaments
• A worthy family of semisymmetric graphs

Cited In (14)

• Orientable \(\mathbb Z_n\)-distance magic graphs via products
• Distance magic labelings of Cartesian products of cycles
• Distance magic Cartesian products of graphs
• Spectra of graphs and closed distance magic labelings
• Note on distance magic products \(G\circ C_4\)
• Distance magic labeling in complete 4-partite graphs
• Constant sum partition of sets of integers and distance magic graphs
• On closed distance magic circulants of valency up to 5
• Note on group distance magicness on product graphs
• Distance magic labeling of the halved folded \(n\)-cube
• Distance magic labeling of the halved folded \(n\)-cube
• Group distance magic labeling of direct product of graphs
• On distance magic circulants of valency 6
• Union of distance magic graphs

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)