Complete bipartite graph is a totally irregular total graph
Abstract
A graph G is called a totally irregular total k-graph if it has a totally irregular total k-labeling λ : V ∪ E→ 1, 2, ... , k, that is a total labeling such that for any pair of different vertices x and y of G, their weights wt(x) and wt(y) are distinct, and for any pair of different edges e and f of G, their weights wt(e) and wt(f) are distinct. The minimum value k under labeling λ is called the total irregularity strength of G, denoted by ts(G). For special cases of a complete bipartite graph Km, n, the ts(K1, n) and the ts(Kn, n) are already determined for any positive integer n. Completing the results, this paper deals with the total irregularity strength of complete bipartite graph Km, n for any positive integer m and n.
Keywords
Full Text:
PDFDOI: http://dx.doi.org/10.5614/ejgta.2021.9.2.11
References
M. Baca, S. Jendrol, M. Miller and J. Ryan, On irregular total labeling, Discrete Math., 307 (2007), 1378-1388.
J.A. Gallian, A dynamic survey of graph labeling, Electron J. Combin., 19 (2016), #DS6.
D. Indriati, Widodo, I.E. Wijayanti, and K.A. Sugeng, On total irregularity strength of star graphs, double-stars, and caterpillar, AIP Conference Proceedings, 1707(1) (2016), 020008(1)-020008(6).
J. Ivanco and S. Jendrol, Total edge irregularity strenght of trees, Discuss. Math. Graph Theory, 26 (2006), 449–456.
S. Jendrol, J. Miskuf, and R. Sotak, Total edge irregularity strength of complete graphs and complete bipartite graphs, Discrete Math., 310 (2010), 400–407.
P. Jeyanthi and A. Sudha, On the total irregularity strength of some graphs, Bull. Inter. Math. Virtual Inst., 9(2) (2019), 393-401.
C.C. Marzuki, A.N.M. Salman, and M. Miller, On the total irregularity strength of cycles and paths, Far East J. Math Sci. (FJMS), 82(1) (2013), 1-21.
R. Ramdani and A.N.M. Salman, On the total irregularity strength of some cartesian product graphs, AKCE Int. J. Graphs Comb., 10(2) (2013), 199-209.
R. Ramdani, A.N.M. Salman, and H. Assiyatun, Total irregularity strength of regular graphs, J. Math. Fundam. Sci., 47(3) (2015), 281-295.
R. Ramdani, A.N.M. Salman, H. Assiyatun, A. Semanicova-Fenovcikova, and M. Baca, Total irregularity strength of three family of graphs, Math. Comput. Sci., 9 (2015), 229-237.
P.D.M. Taihuttu, M.I. Tilukay, F.Y. Rumlawang, and Z. A. Leleury, The total irregularity strength of some complete bipartite graphs, Proceedings of 3rd International Seminar of Basic Sciences, FMIPA, Universitas Pattimura, ISBN 978-602-61644-0-7 (2017), 149-157.
M.I. Tilukay, A.N.M. Salman, and E.R. Persulessy, On the total irregularity strength of fan, wheel, triangular book, and friendship graphs, Procedia Computer Science, 74 (2015), 124-131.
M.I. Tilukay, B.P. Tomasouw, F.Y. Rumlawang, and A.N.M. Salman, The total irregularity strength of complete graphs and complete bipartite graphs, Far East J. Math Sci. (FJMS), 102(2) (2017), 317-327.
K. Wijaya, Slamin, Surahmat, and S. Jendroˇl, Total vertex irregular labeling of complete bipartite graphs, JCMCC, 55 (2005), 129-136.
Refbacks
- There are currently no refbacks.
ISSN: 2338-2287
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.