![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
For a graph , an edge irregular total
-labelling
is a labelling for edges and vertices of a graph
in such a way that the weights of any two different edges are distinct. The minimum for which
admits an edge irregular total
-labelling is called total edge irregularity strength of
,
. In this paper, the exact value of total edge irregularity strength of the polar grid graph was determined. We have also determined the total edge irregularity strength for a polar grid graph.
2010 Mathematics subject classification:
1. Introduction
Graph labelling is an extremely useful tool for making a lot of problems in different areas of human life very easy to be handled in a mathematical way. So, it is an important branch in graph theory and has a lot of applications in many fields, for instance, coding theory, astronomy, communication network and optimal circuit layouts.
A labelling of a simple, connected and undirected graph that is defined as a function that assigns some set of elements of a graph
with a set of positive or non-negative integer. According to a domain of a labelling, we have three types of it. The first one vertex labels if the domain is a vertex-set, the second is edge labelling when edge-set is the domain and finally, total labelling that its domain is the union of edge-set and vertex-set.
Bača et al. [Citation1] defined an edge irregular total labelling of a graph
as a labelling
such that every two distinct edges
and
of a graph
have distinct weights, i.e.
. If a graph
admits an edge irregular total
-labelling and
is minimum then we say that
has a total edge irregularity strength denoted by
. Furthermore, in [Citation1], for any graph
, a lower bound of
is given by
(1)
(1) Since then, many authors try to find exact values for the total edge irregularity strength of graphs. Ivanĉo et al. [Citation2] proved that
is equal its lower bound where
is any tree. In [Citation3,Citation4] authors determined the exact value of total edge irregularity strength for complete bipartite graph, complete graph and the corona of the path to path, a star and cycle. Ahmad et al. [Citation5] determined
that
is generalized helm graph
with
,
. On the other hand, in [Citation6–8] the total edge irregularity strengths for fan graph, wheel graph, triangular Book graph, friendship graph, centralized uniform theta graphs and large graphs are investigated. For definitions, applications and terminology are not mentioned in our paper, see [Citation5,Citation8–26].
In this paper, the exact value of total edge irregularity strength of the polar grid graph was determined.
2. Main results
In this section, we determined the total edge irregularity strength of a polar grid graph , and a polar grid graph
. Finally, the exact value of the total edge irregularity strength of a generalized polar grid graph
was determined.
Theorem 2.1.
Let be a polar grid graph with
vertices and
edges,
. Then
Proof: Since ,
. Then by (1) we have
For the inverse inequality, we sufficient to show the existence of an edge irregular total labelling with Let
and
is a total
-labelling defined as
Obviously, all edges and vertex labels are at most . Also, the weights of edges under the labelling
are given by:
It is clear that the weights for any two different edges in are distinct (Figure ). Therefore,
is an edge irregular total
-labelling f
. Hence
Theorem 2.2.
Let and
be a polar grid graph with
vertices and
edges. Then
Proof: Since
,
. Then from (1) we have
To prove the invers inequality, we need to show that there exist an edge irregular total -labelling,
, for a graph
Suppose that
and
is a total
-labelling. The proof is divided into three cases as follows:
Case 1:
Define as follows:
It is easy to check that the greatest label is . Next, the weights of edges of
are given by:
It is easy to check that the edge- weights of edges are pairwise distinct. So,
Case 2:
Define as follows:
It is clear that the largest label is . The edge- weights are given by:
It implies that the weights of edges are distinct. Then,
Case 3:
is defined as follows:
Obviously, the greatest label is . Also, the weights of the edges of the graph
are given by:
From the above equations it is clear that the edge- weights are distinct. So
is an edge irregular total
-labelling,
. Hence
Theorem 2.3.
If is a polar grid graph with
vertices and
edges,
. Then
Proof: Since ,
, then by (1)
To prove the inverse of previous inequality, it is necessary to show that there exists an edge irregular total -labelling for
with
as follows:
Let and a total
-labelling
is defined as:
Obviously, the greatest label is . The weights of the edges of
expressed as:
Upon checking, it was found that the weights of any two different edges are different. Hence is an edge irregular total
-labelling for being
, i.e.
3. Conclusion
In this paper, we have determined the total edge irregularity strength for a polar grid graph , and a polar grid graph
. Finally, the exact value of total edge irregularity strength for a generalized polar grid graph
was determined.
Acknowledgements
The author expresses his sincere thanks to the reviewers for valuable comments and suggestions, which helped to improve the quality of the paper.
Disclosure statement
No potential conflict of interest was reported by the author.
ORCID
F. Salama http://orcid.org/0000-0002-3555-7349
References
- Bača M, Jendroî S, Miller M, et al. On irregular total labellings. Discrete Math. 2007;307(11):1378–1388. doi: 10.1016/j.disc.2005.11.075
- Ivanĉo J, Jendroî S. Total edge irregularity strength of trees. Discuss Math Graph Theory. 2006;26:449–456. doi: 10.7151/dmgt.1337
- Jendroî S, Miŝkuf J, Soták R. Total edge irregularity strength of complete and complete bipartite graphs. Electron. Notes Discrete Math. 2007;28:281–285. doi: 10.1016/j.endm.2007.01.041
- Miškuf J, Jendroî S. On total edge irregularity strength of the grids. Tatra Mt Math Publ. 2007;36:147–151.
- Ahmad A, Arshad M, Ižaríková G. Irregular labelings of helm and sun graphs. AKCE Int J Graphs Combin. 2015;12:161–168. doi: 10.1016/j.akcej.2015.11.010
- Salman ANM, Baskoro ET. The total edge-irregular strengths of the corona product of paths with some graphs. J Combin Math Combin Comput. 2008;65:163–175.
- Ponraj R, Narayanan SS. Mean cordiality of some snake graphs. Palestine J Math. 2015;4(2):439–445.
- Siddiqui MK. On edge irregularity strength of subdivision of star Sn. Int J Math Soft Comput. 2012;2:75–82. doi: 10.26708/IJMSC.2012.1.2.09
- Ahmad A, Al-Mushayt OBS, Bača M. On edge irregularity strength of graphs. Appl Math Comput. 2014;243:607–610.
- Ahmad A, Bača M. Total edge irregularity strength of a categorical product of two paths. Ars Combin. 2014;114:203–212.
- Ahmad A, Bača M, Bashir Y, et al. Total edge irregularity strength of strong product of two paths. Ars Combin. 2012;106:449–459.
- Ahmad A, Bača M, Siddiqui MK. On edge irregular total labeling of categorical product of two cycles. Theory Comp Systems. 2014;54(1):1–12. doi: 10.1007/s00224-013-9470-3
- Ahmad A, Siddiqui MK, Afzal D. On the total edge irregularity strength of zigzag graphs. Australas J Comb. 2012, 54, 141–149.
- Ahmad A, Bača M. Edge irregular total labeling of certain family of graphs. AKCE J Graphs Combin. 2009;6:21–29.
- Al-Mushayt O, Ahmad A, Siddiqui MK. On the total edge irregularity strength of hexagonal grid graphs. Australian J Combin. 2012;53:263–271.
- Bača M, Siddiqui MK. Total edge irregularity strength of generalized prism. Applied Math Comput. 2014;235:168–173.
- Brandt S, Miškuf J, Rautenbach D. On a conjecture about edge irregular total labellings. J Graph Theory. 2008;57:333–343. doi: 10.1002/jgt.20287
- Daoud SN, Elsawy AN. Edge even graceful labelling of new families of graphs. J Taibah Univ Sci. 2019;13(1):579–591. doi: 10.1080/16583655.2019.1611180
- Faudree RJ, Jacobson MS, Lehel J, et al. Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discrete Math. 1988;76:223–240. doi: 10.1016/0012-365X(89)90321-X
- Hinding N, Suardi N, Basir H. Total edge irregularity strength of subdivision of star. J Discrete Math Sci Cryptogr. 2015;18(6):869–875. doi: 10.1080/09720529.2015.1032716
- Jeyanthi P, Sudha A. Total edge irregularity strength of disjoint union of wheel graphs. Elec Notes Discrete Math. 2015;48:175–182. doi: 10.1016/j.endm.2015.05.026
- Majerski P, Przybylo J. On the irregularity strength of dense graphs. SIAM J Discrete Math. 2014;28(1):197–205. doi: 10.1137/120886650
- Putra RW, Susanti Y. On total edge irregularity strength of centralized uniform theta graphs. AKCE Int J Graphs Combin. 2018;15:7–13. doi: 10.1016/j.akcej.2018.02.002
- Rajasingh I, Arockiamary ST. Total edge irregularity strength of series parallel graphs. Int J Pure Appl Math. 2015;99(1):11–21. doi: 10.12732/ijpam.v99i1.2
- Ramdani R, Salman ANM. On the total irregularity strength of some Cartesian product graphs. AKCE Int J Graphs Combin. 2013;10(2):199–209.
- Tilukay MI, Salman ANM, Persulessy ER. On the total irregularity strength of fan, wheel, triangular book, and friendship graphs. Procedia Comput Sci. 2015;74:124–131. doi: 10.1016/j.procs.2015.12.087