Graphs and Combinatorics

, Volume 17, Issue 1, pp 171–175 | Cite as

Super-Magic Complete k-Partite Hypergraphs

  • Marián Trenkler


 We deal with complete k-partite hypergraphs and we show that for all k≥2 and n≠2,6 its hyperedges can be labeled by consecutive integers 1,2,…,n k such that the sum of labels of the hyperedges incident to (k−1) particular vertices is the same for all (k−1)-tuples of vertices from (k−1) independent sets.

Key words. Complete k-partite hypergraph Super-magic Labeling 
1991 Mathematics Subject Classification. 05C99 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Tokyo 2001

Authors and Affiliations

  • Marián Trenkler
    • 1
  1. 1.Šafárik University, Jesenná 5, 041 54 Košice, Slovakia. e-mail: trenkler@duro.upjs.skXX

Personalised recommendations