TARU PUBLICATIONS
Journal of Information and Optimization Sciences cover

Journal of Information and Optimization Sciences

(Since 1980)
Open Access ·Peer-reviewed·ISSN (Online): 2169-0103·ISSN (Print): 0252-2667

WoS  JIF 2026 : 0.4 (Q4)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research on topics in information and optimization sciences.

Issues up to 2022 co-published with and available at:Taylor & Francis
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Information and Optimization Sciences
Open Access Research Article

On magic total labelings in combinatorial designs

*

* Corresponding author · click or hover a name for details

pp. 47–56Vol. 45Issue 1January 2024DOI: 10.47974/JIOS-1143XML
Received:
14 Sep 2021
Accepted:
08 Mar 2022
Published Online:
05 Feb 2024
Article type:
Research Article
Language:
EN
Article no.:
JIOS-1143
Pages:
47–56

Abstract

Let H be a graph and ẞ  be an H-decomposition of G. The H-magic total labeling of a graph G is an assignment of integers set [1, |V(G)∪E(G)|]  to V(G)∪E(G)  such that: any vertex and any edge of G receive distinct integers, and the sum of all vertices receive integers and all edges receive integers on B is a constant for any B ∈ ẞ.  In this paper we study the H-super magic problems of balanced incomplete block designs and resolvable balanced incomplete block designs. 

Keywords

H-(super) magic decompositionMagic total labelingk-factorablePartition of setBalanced incomplete block design

Subject Classifications

(2010) 05B3005C78

References

[1] G.S. Bloom and S.W. Golomb, Applications of numbered undirected graphs, Proc. IEEE, 65(1977), 562-570. 
[2] G.S. Bloom and S.W. Golomb, Numbered complete graphs, unusual rules, and assorted applications, In: Theory and Applications of Graphs, Lecture Notes in Math., 642(1978), 53-65. 
[3] B. Kalantari and G.B. Khosrovshahi, Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP, Networks, 28(1996), 211-219. 
[4] E.T. Baskoro, R. Simanjuntak and M.T. Adithia, Two level secret sharing schemes based on magic labelings, Proceedings INA-CISC 2005, Indonesia Cryptology and Information Security, March 30-31 (2005), 151-154. 
[5] W.D. Wallis, Magic Graphs, Birkhäuser, Boston-Basel-Berlin, 2001. 
[6] B. Hartnell and D. Rall, A vertex-magic edge labeling game, Congr. Numer. 161(2003), 163-167. 
[7] A. Kotzig, A. Rosa, Magic valuations of finite graphs, Canad. Math. Bull., 13(1970), 451-461. 
[8] ]N. Inayah, A. Lladó and J. Moragas, Magic and antimagic H-decompositions, Discrete Math., 312 (2012), 1367-1371. 
[9] Dongxu Zhu, Zhihe Liang, On the super (a,d)-H-antimagic total labelings of path chain graphs, Journal of Information and Optimization Sciences, 42(3) (2021), 689-700. 
[10] J.A. Gallian, A dynamic survey of graph labelings, Electron. J. Combin., (2017) # DS6, http://www.combinatorics.org/surveys/ds6.pdf. 
[11] Zhihe Liang, On the G-supermagic coverings of graphs, Acta Mathematicae Applicatae Sinica (Chinese Series), 37(5) (2014), 857-864. 
[12] Zhihe Liang, Cycle-supermagic decompositions of complete multipartite graphs, Discrete Mathematics, 312 (2012), 3342-3348. 
[13] T. P. Kirkman, On a problem in combinations, Cambridge and Dublin Math. Journal, 2(1847), 191-204. 
[14] R. Balakrishnan, K. Ranganathan, A Textbook of Graph Theory (Second Edition), Springer Science Business Media, New York, 2012. 
[15] B. Alspach and H. Gavlas, Cycle decompositions of  and  J. Combin. Theory (B), 81(2001), 77-99. 
[16] C. C. Lindner, C. A. Rodger, Design theory, CRC Press, New York, 1997, 78. 
[17] C. J. Colbourn, J. H. Dinitz, Handbook of Combinatorial Designs, 2nd Ed., Chapman & Hall/CRC, 2007, 124-125.

Views: 93Downloads: 18Citations: 0