Loading...
Loading...

Go to the content (press return)

Magic and antimagic H-decompositions

Author
Inayah, N.; Llado, A.; Moragas, J.
Type of activity
Journal article
Journal
Discrete mathematics
Date of publication
2012-12-03
Volume
312
Number
7
First page
1367
Last page
1371
DOI
https://doi.org/10.1016/j.disc.2011.11.041 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S0012365X11005486 Open in new window
Abstract
A decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bijection f:V(G)¿E(G)¿0,1,...,|V(G)|+|E(G)|-1 such that the sum of labels of edges and vertices of each copy of H in the decomposition is constant. It is known that complete graphs do not admit K2-magic decompositions for n>6. By using the results on the sumset partition problem, we show that the complete graph K2 m+1 admits T-magic decompositions by any graceful tree with m edges. We address analogous pr...
Keywords
Graph decompositions, Magic labelings
Group of research
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants