On Distance Irregular Labeling of Disconnected Graphs
Download PDF
Authors: F. SUSANTO, K. WIJAYA, P. M. PURNAMA AND SLAMIN
DOI: 10.46793/KgJMat2204.507S
Abstract:
Keywords:
Distance irregular labeling, disconnected graphs, paths, suns, helms, friendships.
References:
[1] S. Arumugam and N. Kamatchi, On (a,d)-distance antimagic graphs, Australas. J. Combin. 54 (2012), 279–288.
[2] N. H. Bong, Y. Lin and Slamin, On distance-irregular labelings of cycles and wheels, Australas. J. Combin. 69 (2017), 315–322.
[3] G. Chartrand, M. S. Jacobson, J. Lehel, O. R. Oellermann, S. Ruiz and F. Saba, Irregular networks, Congr. Numer. 64 (1988), 197–210.
[4] G. Chartrand and P. Zhang, Graphs & digraphs, Sixth Ed., Taylor & Francis Group, 2016.
[5] J. A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. (2018), #DS6.
[6] M. Miller, C. Rodger and R. Simanjuntak, Distance magic labelings of graphs, Australas. J. Combin. 28 (2003), 305–315.
[7] S. Novindasari, Marjono and S. Abusini, On distance irregular labeling of ladder graph and triangular ladder graph, Pure Math. Sci. 5 (2016), 75–81.
[8] Slamin, On distance irregular labelling of graphs, Far East J. Math. Sci. 102 (2017), 919–932.
Login:
