Union of distance magic graphs
DOI10.7151/DMGT.1932zbMATH Open1354.05115OpenAlexW2553276504MaRDI QIDQ503682FDOQ503682
Authors: Sylwia Cichacz, Mateusz Nikodem 
Publication date: 23 January 2017
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1932
Recommendations
Kronecker productdirect productdistance magic labelingmagic constantsigma labelinglexicographic productgraph labelingKotzig arrayunion of graphs
Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- A dynamic survey of graph labeling
- Handbook of product graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On \(\Sigma\) and \(\Sigma'\) labelled graphs
- Constant sum partition of sets of integers and distance magic graphs
- Handicap distance antimagic graphs and incomplete tournaments
- Distance magic Cartesian products of graphs
- Title not available (Why is that?)
- Note on distance magic products \(G\circ C_4\)
- Distance magic labeling and two products of graphs
- Distance magic (\(r, t\))-hypercycles
- Distance magic circulant graphs
- Title not available (Why is that?)
- Note on group distance magic graphs \(G[C_4]\)
- Fair incomplete tournaments
- Isomorphic components of Kronecker product of bipartite graphs
- Constructing distance magic graphs from regular graphs
- Distance magic labelings of a union of graphs
Cited In (7)
This page was built for publication: Union of distance magic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503682)
