Distance magic labeling in complete 4-partite graphs

DOI10.1007/S00373-015-1627-1MaRDI QIDQ293634zbMATH OpenOpenAlexFDO

Authors Daniel Kotlar

Publication date 9 June 2016

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

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

zbMATH Keywords

distance magic labelingequitable partition

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: Let $G$ be a complete $k$-partite simple undirected graph with parts of sizes $p_{1}le{p}_2\mathrm{...}le{p}_k$. Let $P_j=su{m}_{i=1}^j{p}_i$ for $j=1,\mathrm{...},k$. It is conjectured that $G$ has distance magic labeling if and only if $su{m}_{i=1}^{P_j}(n-i+1)gejn+1choose2/k$ for all $j=1,\mathrm{...},k$. The conjecture is proved for $k=4$, extending earlier results for $k=2,3$.

Recommendations

• Note on group distance magic complete bipartite graphs
• scientific article; zbMATH DE number 1998306
• Note on distance magic products G C₄
• Distance magic Cartesian products of graphs
• A note on 4-regular distance magic graphs

Cites work

• Distance magic labeling and two products of graphs
• scientific article; zbMATH DE number 1998306 (Why is no real title available?)
• scientific article; zbMATH DE number 6273983 (Why is no real title available?)
• On \(\Sigma\) and \(\Sigma'\) labelled graphs
• Spectra of graphs and closed distance magic labelings

Cited in

(2)

• Constant sum partition of sets of integers and distance magic graphs
• Note on group distance magic complete bipartite graphs

This page was built for publication: Distance magic labeling in complete 4-partite graphs

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