Constant sum partition of sets of integers and distance magic graphs

DOI10.7151/dmgt.1991zbMath1377.05166OpenAlexW2625697570MaRDI QIDQ1692633

Sylwia Cichacz, Agnieszka Goerlich

Publication date: 10 January 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1991

zbMATH Keywords

distance magic labelingproduct of graphsconstant sum partition

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Distance magic Cartesian products of graphs ⋮ On distance magic circulants of valency 6 ⋮ Union of distance magic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance magic Cartesian products of graphs
• Distance magic labeling in complete 4-partite graphs
• On the modular sumset partition problem
• Note on distance magic products \(G\circ C_4\)
• Distance magic labeling and two products of graphs
• Disjoint subsets of integers having a constant sum
• On \(\Sigma\) and \(\Sigma'\) labelled graphs
• Disjoint odd integer subsets having a constant odd sum
• On the ascending star subgraphs decomposition of star forests
• Disjoint odd integer subsets having a constant even sum
• A dynamic survey of graph labeling
• Ascending subgraph decompositions of regular graphs
• Magic rectangles revisited
• A note on ascending subgraph decompositions of complete multipartite graphs
• Partition of a set of integers into subsets with prescribed sums
• Uniqueness of Vertex Magic Constants
• On the Sumset Partition Problem