Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Magic and antimagic H-decompositions

Autor
Inayah, N.; Llado, A.; Moragas, J.
Tipus d'activitat
Article en revista
Revista
Discrete mathematics
Data de publicació
2012-12-03
Volum
312
Número
7
Pàgina inicial
1367
Pàgina final
1371
DOI
https://doi.org/10.1016/j.disc.2011.11.041 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0012365X11005486 Obrir en finestra nova
Resum
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...
Paraules clau
Graph decompositions, Magic labelings
Grup de recerca
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants