Abstract
An edge irregular total k-labeling φ:V(G)∪E(G)→{1,2,…,k} of a graph G=(V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights φ(x)+φ(xy)+φ(y) and φ(x′)+φ(x′y′)+φ(y′) are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling.
In this paper, we determine the exact value of the total edge irregularity strength of the categorical product of two cycles C n and C m , for n,m≥3.
Similar content being viewed by others
References
Ahmad, A., Bača, M.: Total edge irregularity strength of a categorical product of two paths. Ars Comb. (in press)
Bača, M., Jendroľ, S., Miller, M., Ryan, J.: On irregular total labellings. Discrete Math. 307, 1378–1388 (2007)
Bohman, T., Kravitz, D.: On the irregularity strength of trees. J. Graph Theory 45, 241–254 (2004)
Brandt, S., Miškuf, J., Rautenbach, D.: On a conjecture about edge irregular total labellings. J. Graph Theory 57, 333–343 (2008)
Chartrand, G., Jacobson, M.S., Lehel, J., Oellermann, O.R., Ruiz, S., Saba, F.: Irregular networks. Congr. Numer. 64, 187–192 (1988)
Chunling, T., Xiaohui, L., Yuansheng, Y., Liping, W.: Irregular total labellings of C m □C n . Util. Math. 81, 3–13 (2010)
Dimitz, J.H., Garnick, D.K., Gyárfás, A.: On the irregularity strength of the m×n grid. J. Graph Theory 16, 355–374 (1992)
Haque, K.M.M.: Irregular total labellings of generalized Petersen graphs. Theory Comput. Syst. 50, 537–544 (2012)
Ivančo, J., Jendroľ, S.: Total edge irregularity strength of trees. Discuss. Math., Graph Theory 26, 449–456 (2006)
Jendroľ, S., Tkáč, M., Tuza, Z.: The irregularity strength and cost of the union of cliques. Discrete Math. 150, 179–186 (1996)
Jendroľ, S., Miškuf, J., Soták, R.: Total edge irregularity strength of complete and complete bipartite graphs. Electron. Notes Discrete Math. 28, 281–285 (2007)
Jendroľ, S., Miškuf, J., Soták, R.: Total edge irregularity strength of complete graphs and complete bipartite graphs. Discrete Math. 310, 400–407 (2010)
Miškuf, J., Jendroľ, S.: On total edge irregularity strength of the grids. Tatra Mt. Math. Publ. 36, 147–151 (2007)
Nurdin, Salman, A.N.M., Baskoro, E.T.: The total edge-irregular strengths of the corona product of paths with some graphs. J. Comb. Math. Comb. Comput. 65, 163–175 (2008)
Rall, D.F.: Total domination in categorical products of graphs. Discuss. Math., Graph Theory 25(1–2), 35–44 (2005)
Tardif, C., Wehlau, D.: Chromatic numbers of products of graphs: the directed and undirected versions of the Poljak-Rödl function. J. Graph Theory 51, 33–36 (2006)
Togni, O.: Irregularity strength of the toroidal grid. Discrete Math. 165/166, 609–620 (1997)
Acknowledgements
The research for this article was supported by Slovak VEGA Grant 1/0130/12 and Higher Education Commission Pakistan Grant HEC(FD)/2007/555.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ahmad, A., Bača, M. & Siddiqui, M.K. On Edge Irregular Total Labeling of Categorical Product of Two Cycles. Theory Comput Syst 54, 1–12 (2014). https://doi.org/10.1007/s00224-013-9470-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-013-9470-3