Union of distance magic graphs
From MaRDI portal
Publication:503682
DOI10.7151/DMGT.1932zbMath1354.05115OpenAlexW2553276504MaRDI QIDQ503682
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
Kronecker productgraph labelingdirect productdistance magic labelingmagic constantsigma labelinglexicographic productKotzig arrayunion of graphs
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Distance magic Cartesian products of graphs
- Note on distance magic products \(G\circ C_4\)
- Distance magic labeling and two products of graphs
- Distance magic circulant graphs
- Distance magic labelings of a union of graphs
- On \(\Sigma\) and \(\Sigma'\) labelled graphs
- A dynamic survey of graph labeling
- Constant sum partition of sets of integers and distance magic graphs
- Note on group distance magic graphs \(G[C_4\)]
- Handicap distance antimagic graphs and incomplete tournaments
- Isomorphic components of Kronecker product of bipartite graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Union of distance magic graphs