On total irregular labelings with no-hole weights of some planar graphs
-
Sarbari Mitra
and
Soumya Bhoumik
Abstract
A total edge irregular k-labeling of a graph G = (V, E), ∂: V ∪ E → {1, 2, 3, ⋯, k} is a labeling of vertices and edges of G in such a way that the weights of all edges are distinct. A total edge irregularity strength of graph G, denoted by tes(G) is defined as the minimal k for which a graph G has a totally irregular total k-labeling. Analogously we can define total vertex irregularity strength of graph G, denoted by tvs(G). In this paper, we provide the no-hole total (both edge and vertex) irregularity strength for some well known planar graphs.
Originally published in Diskretnaya Matematika (2024) 36, №2, 23–32 (in Russian).
References
[1] Ahmad A., Ibrahim M., Siddiqui M. K., “On the total irregularity strength of generalized Petersen graph”, Math. Rep. (Bucur.), 18(68):2 (2016), 197–204.Search in Google Scholar
[2] Beča M., Jendrol S., Miller M., Ryan J., “On irregular total labeling”, Discrete Mathematics, 307 (2007), 1378–1388.Search in Google Scholar
[3] Bondy J. A., Murty U. S. R., Graph theory, Springer, New York, 2008, 244 pp.Search in Google Scholar
[4] Chartrand G., Jacobson M. S., Lehel J., Oellermann O. R., Ruiz S., Saba F., “Irregular networks”, Congr. Numer., 64 (1988), 355–374.Search in Google Scholar
[5] Gallian J. A., “A dynamic survey of graph labeling”, Electr. J. Comb., 16(3) (2019).Search in Google Scholar
[6] Ivančo J., Jendrol S., “Total edge irregularity strength of trees”, Discussiones Math. Graph Theory, 26:3 (2006), 449–456.Search in Google Scholar
[7] Jendrol S., Miškuf J., Soták R., “Total edge irregularity strength of complete graphs and complete bipartite graphs”, Electr Notes Discrete Math., 28 (2007), 281–285.Search in Google Scholar
[8] Jendro S.l, Miškuf J., Soták R., “Total edge irregularity strength of complete graphs and complete bipartite graphs”, Discrete Mathematics, 310 (2010), 400–407.Search in Google Scholar
[9] Nurdin S., Baskoro E. T., Salman A. N. M., Gaos N. N., “On the total vertex irregularity strength of trees”, Discrete Math., 310 (2010), 3043–3048.Search in Google Scholar
[10] Sudibyo N., Iswardani A., Surya Y., Hidayat R., “Total vertex irregularity strength of disjoint union of ladder Rung graph and disjoint union of Domino graph”, J. Matematika MANTIK, 6:1 (2019), 47–51.Search in Google Scholar
[11] Wallis W. D., Magic Graphs, Birkhauser, Boston, 2001.Search in Google Scholar
© 2024 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- On a relationship between linear and differential characteristics of binary vector spaces mappings and diffusion characteristics over blocks of imprimitivity systems of translation group of the binary vector space
- Methods of linear and differential relations in cryptography
- On total irregular labelings with no-hole weights of some planar graphs
- Critical branching processes evolving in a unfavorable random environment
Articles in the same Issue
- Frontmatter
- On a relationship between linear and differential characteristics of binary vector spaces mappings and diffusion characteristics over blocks of imprimitivity systems of translation group of the binary vector space
- Methods of linear and differential relations in cryptography
- On total irregular labelings with no-hole weights of some planar graphs
- Critical branching processes evolving in a unfavorable random environment
