Abstract
One of the extremely useful branches in graph theory is the labeling of a graph. Graph labeling plays a vital role in many fields such as database management, astronomy, coding theory, X-ray crystallography, communication network addressing and radar. A labeling of a connected simple graph \(G\left( {V,E} \right)\) is a map that assign each element in \(G\) with a positive integer number. An edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling is a map \(\beta :V\left( G \right) \cup E\left( G \right) \to \left\{ 1,2,3, \ldots ,\lambda^{\!\!\!\!\!-} \right\}\) such that \(W_\beta \left( h \right) \ne W_\beta \left( z \right)\) where \(W_\beta \left( h \right)\) and \(W_\beta \left( z \right)\) are weights for any two distinct edges. In this case, \(G\) has total edge irregularity strength (TEIS) if \(\lambda^{\!\!\!\!\!-}\) is minimum. In this paper, a new family of graphs called square snake graphs is defined and denoted by \(C_{4,n}\). Moreover, we define some related graphs of square snake graphs named double square snake graph \(D\left( {C_{4,n} } \right)\), triple square snake graph \(T\left( {C_{4,n} } \right)\) and \(m\)-multiple square snake graph \(M_m \left( {C_{4,n} } \right)\). Finally, we determine TEIS for square snake graphs, double square snake graph, triple square snake graph and \(m\)-multiple square snake graph, which have many applications in coding theory and physics.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
For a simple, connected and undirected graph \(G\left( {V,E} \right)\), Bača et al. (2007) have introduced the notion of an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling \(\beta :V\left( G \right) \cup E\left( G \right) \to \left\{ 1,2,3, \ldots ,\lambda^{\!\!\!\!\!-} \right\}\) to be a labeling of edges and vertices in such a way that any two edges \(pq\) and \(p^* q^*\) of a graph \(G\) have distinct weights, i.e. \(w_\beta \left( {pq} \right) \ne w_\beta \left( {p^* q^* } \right)\) where \(w_\beta \left( {pq} \right) = \beta \left( {pq} \right) + \beta \left( p \right) + \beta \left( q \right)\). The minimum \(\lambda^{\!\!\!\!\!-}\) for which \(G\left( {V,E} \right)\) has an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling is named TEIS and denoted by \(tes\left( G \right).\) Also, They have estimated the bounds of TEIS of \(tes\left( G \right)\) for a graph \(G\) in the following inequality
where \(\Delta G\) is maximum degree of vertices of a graph \(G.\)
In Ivanĉo and Jendroî (2006) Ivanĉo and Jendroî introduced the conjecture which gives a TEIS for any graph \(G\), except \(K_5\), in the form
In addition, they have determined TEIS for a tree \(T\) as
The conjecture of Ivanĉo and Jendroî has been verified for a heptagonal snake graph, uniform theta snake graphs, quintet snake graph, a polar grid graph and special families of graphs in Salama (2022, 2021, 2019, 2020a) and Salama and Abo Elanin (2021), for cylindrical accordion graph and spiral accordion graph in Siddiqui et al. (2017), for complete bipartite graphs and complete graphs in Jendroî et al. (2007), for corona product of a path with certain graphs in Salman and Baskoro (2008), for the categorical product of two paths \(P_n \times P_m\) in Ahmad and Bača (2014), for centralized uniform theta graphs in Putra and Susanti (2018), for zigzag graphs in Ahmad et al. (2012), for sunlet graph and the line of sunlet graph in Salama (2020b), for hexagonal grid graphs in Al-Mushayt et al. (2012), for a wheel graph, a fan graph, a triangular Book graph and a friendship graph in Tilukay et al. (2015), for generalized prism in Bača and Siddiqui (2014), for disjoint union of isomorphic copies of generalized Petersen graph in Naeem et al. (2017) and for subdivision of star graph in Siddiqui (2012), for more details see Majerski and Przybylo (2014), Rajasingh and Arockiamary (2015), Jeyanthi and Sudha (2015), Tarawneh et al. (2021), Yang et al. (2018), Ahmad et al. (2016, 2015), Jegan et al. (2022), Nurdini et al. (2020), Mary et al. (2018), Ratnasari et al. (2019) and Arockiamary and Vistthra (2022).
Motivated by the previous results, in this paper, we define some related graph of square snake graphs named double square snake graph \(D\left( {C_{4,n} } \right)\), triple square snake graph \(T\left( {C_{4,n} } \right)\) and m-multiple square snake graph Finally, we determine the exact value of the total edge irregularity strength (TEIS) for square snake graphs, double square snake graph, triple square snake graph and m-multiple square snake graph, in the form:
Which have many applications in coding theory and physics.
2 Main results
The table of notations and acronyms is used in this paper (Table 1).
In this section we define a new family of graphs and determine the exact value of TEIS for it which are used in scanner and bar code as follows:
Let the vertices \(x_1 , x_2 , x_3 , \ldots ,x_n\) be \(n\) computer scanners jointed with \(n\) automatic scanners. Let the vertices \(c_1 , c_2 , c_3 , \ldots ,c_{n + 1}\) be representing \(n + 1\) automatic scanner and item details, connected with \(n\) computer scanner and \(n\) alarm. Now, we have two options, one is an alarm system barcode-neutralized system, other is a barcode-neutralized system that is combined with an exit option (Fig. 1).
Definition 1
A square snake graph \(C_{4,n}\) is a graph obtained by replacing every edge of a path \(P_n\) by a square \(C_4\), as shown in Fig. 2.
In the following the flow chart of the steps which follow through our work,
In the following theorem, we calculate the TEIS of the square snake graph \(C_{4,n}\) by using inequality (1):
Theorem 1
For a square snake graph \(C_{4,n}\) a TEIS is given by:
Proof
For a square snake graph, we find \(\left| {E\left( {C_{4,n} } \right)} \right| = 4n\) and \(\Delta \left( {C_{4,n} } \right) = 4\), then from (1) we have
To prove the inverse inequality, we will show that there exists an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling for \(C_{4,n}\). Consider \(\lambda^{\!\!\!\!\!-} = \left\lceil {\frac{4n + 2}{3}} \right\rceil\) and \(\beta :V\left( {C_{4,n} } \right) \cup E\left( {C_{4,n} } \right) \to \left\{1,2,3, \ldots ,\lambda^{\!\!\!\!\!-} \right\}\) is a total \(\lambda^{\!\!\!\!\!-}\)-labeling which is defined in the following cases as:
Case 1: In this case, we will discuss an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling when the remainder of the division of \(4n + 2\) by 3 is 0 or 1 (Fig. 3).
β is defined as:
It is clear that \(\lambda^{\!\!\!\!\!-}\) is the greatest label. In addition, the weights of edges of \(C_{4,n}\) are given by:
Obviously, the edges weights are distinct. Therefore, \(\beta\) is an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling. Hence.
Case 2: In this case, we will discuss an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling when the remainder of the division of \(4n + 2\) by 3 is 2.
Define \(\beta\) as:
Clearly, \(\lambda^{\!\!\!\!\!-}\) is the most label of edges and vertices. The weights of the edges are given as follows:
From the above equations we can deduce that the weights of edges are distinct. Then \(\beta\) is an edge irregular itotal \(\lambda^{\!\!\!\!\!-}\)-labeling. Hence,
Definition 2
A double square snake graph \(D\left( {C_{4,n} } \right)\) consists of two square graphs that have a common path \(P_n\), see Fig. 4.
Lemma 1
For a double square snake graph \(D\left( {C_{4,n} } \right)\), where \(3 \le n \le 11\). We have
Proof
As \(\left| {E\left( {D\left( {C_{4,n} } \right)} \right)} \right| = 8n\), \(3 \le n \le 11\), then (1) becomes
Our aim is proving equality, so we need only to show that there exists an edge irregular total \(\hbar\)-labeling for \(D\left( {C_{4,n} } \right)\) where \(3 \le n \le 11\) with \(\hbar = \left\lceil {\frac{8n + 2}{3}} \right\rceil\). Let \(\hbar = \left\lceil {\frac{8n + 2}{3}} \right\rceil\) and a total \(\hbar\)-labeling \(\beta :V\left( {D\left( {C_{4,n} } \right)} \right) \cup E\left( {D\left( {C_{4,n} } \right)} \right) \to \left\{ {1,2, \ldots ,\hbar} \right\}\) is defined as:
From the previous equations we deduce that, \(\hbar\) is the greatest label of vertices and edges. We get the weights of edges as follows:
From the above equations of weights of edges we find that they are distinct. Hence, \(\theta\) is an edge irregular total \(\hbar\)-labeling. Thus
Theorem 2
If \(D\left( {C_{4,n} } \right)\) is a double square snake graph, where \(n \ge 12\). Then
Proof
Since \(\left| {E\left( {D\left( {C_{4,n} } \right)} \right)} \right| = 8n\) and \(\Delta \left( {D\left( {C_{4,n} } \right)} \right) = 8\). Then from inequality (1) we have
In the following, we define an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling to get the upper pound. Consider a total \(\lambda^{\!\!\!\!\!-}\)-labeling is a map \(\theta :V\left( {D\left( {C_{4,n} } \right)} \right) \cup E\left( {D\left( {C_{4,n} } \right)} \right) \to \left\{ 1,2, \ldots , \lambda^{\!\!\!\!\!-} \right\},{ }\lambda^{\!\!\!\!\!-} = \left\lceil {\frac{8n + 2}{3}} \right\rceil\).
Throughout the proof we take the following notations:
-
I is the condition:
$$ 1 \le i \le \frac{\lambda^{\!\!\!\!\!-}}{3} \quad {\text{if}}\, \lambda^{\!\!\!\!\!-} \equiv 0\left( {\bmod\,3} \right) \quad {\text{or}}\quad \lambda^{\!\!\!\!\!-} \equiv 1\left( {\bmod\,3} \right) $$ -
II is the condition:
$$ 1 \le i \le \frac{\lambda^{\!\!\!\!\!-}}{3} + 1\quad {\text{if}}\, \lambda^{\!\!\!\!\!-} \equiv 2\left( {\bmod\,3} \right) $$ -
III is the condition:
$$ \frac{\lambda^{\!\!\!\!\!-}}{3} + 1 \le i \le n\quad {\text{if}}\, \lambda^{\!\!\!\!\!-} \equiv 0\left( {\bmod\,3} \right)\quad {\text{or}}\quad \lambda^{\!\!\!\!\!-} \equiv 1\left( {\bmod\,3} \right) $$ -
IV is the condition:
$$ \frac{\lambda^{\!\!\!\!\!-}}{3} + 2 \le i \le n\quad {\text{if}}\,\lambda^{\!\!\!\!\!-} \equiv 2\left( {\bmod\,3} \right) $$ -
V is the condition:
$$ 2 \le i \le \frac{\lambda^{\!\!\!\!\!-}}{3}\quad {\text{if}}\, \lambda^{\!\!\!\!\!-} \equiv 0\left( {\bmod\,3} \right)\quad {\text{or}}\quad \lambda^{\!\!\!\!\!-} \equiv 1\left( {\bmod\,3} \right) $$ -
VI is the condition:
$$ 2 \le i \le \frac{\lambda^{\!\!\!\!\!-}}{3} + 1\quad {\text{if}}\,\lambda^{\!\!\!\!\!-} \equiv 2\left( {\bmod\,3} \right) $$
Now, we define \(\theta\) in the following three cases as:
Case 1: In this case, we will discuss an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling when the remainder of the division of \(8n + 2\) by 3 is 0.
\(\theta\) is defined as:
From the previous equations, we can say that \(\lambda^{\!\!\!\!\!-}\) is the greatest label. Now, the weights of the edge of \(D\left( {C_{4,n} } \right)\) are given by:
Therefore, \(\theta\) is an edge I irregular itotal \(\lambda^{\!\!\!\!\!-}\)-labeling. Hence
Case 2: In this case, we will discuss an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling when the remainder of the division of \(8n + 2\) by 3 is 1.
\(\theta\) is defined for vertices like case 1, but for edges is given by:
From the previous equations, we can say that \(\lambda^{\!\!\!\!\!-}\) is the greatest upper bound. Now, the weights of edge of \(D(C_{4,n} )\) are given by:
Therefore, \(\theta\) is an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling and
Case 3: In this case, we will discuss an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling when the remainder of the division of \(8n + 2\) by 3 is 2.
The function \(\theta\) of vertices \(c_i , x_{1,i} , x_{2,i} ,y_{1,i}\) and \(y_{2,i}\) is the same like case 1. For edges, it is given by:
From the previous equations we can say that \(\lambda^{\!\!\!\!\!-}\) is the greatest upper bound. Now, the weights of edge of \(D(C_{4,n} )\) are given by:
Therefore, \(\theta\) is an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling and
Definition 3
A triple square snake graph \(T\left( {C_{4,n} } \right)\) consists of three square graphs that have a common path \(P_n\), as shown in Fig. 5.
Theorem 3
For a triple square snake graph \(T\left( {C_{4,n} } \right)\) we have
Proof
Since \(\left| {E\left( {T\left( {C_{4,n} } \right)} \right))} \right| = 12n\) and \(\Delta \left( {T\left( {C_{4,n} } \right)} \right) = 12\). Then from (1) we have
To prove the inverse inequality, we show that \(\lambda^{\!\!\!\!\!-}\)-labeling is an edge irregular total for \(T\left( {C_{4,n} } \right)\), where \(\lambda^{\!\!\!\!\!-} = \left\lceil {\frac{12n + 2}{3}} \right\rceil\). Let \(\beta :V\left( {T\left( {C_{4,n} } \right)} \right) \cup E\left( {T\left( {C_{4,n} } \right) } \right) \to \left\{ 1,2,3, \ldots ,\lambda^{\!\!\!\!\!-} \right\}\) be a total \(\lambda^{\!\!\!\!\!-}\)-labeling defined as:
One can check that edges and vertices labels are at most \(\lambda^{\!\!\!\!\!-}\). For the edges weights under the labeling \(\beta\) we have
We deduced from the previous equations that edges’ weights consist of different numbers. Hence, \(\beta\) is an edge irregular total \(\lambda^{\!\!\!\!\!-}\)-labeling of \(T\left( {C_{4,n} } \right)\) and
Definition 4
If we replaced every edge in the path Pn by m-multiple square graphs we have which called m-multiple square snake graph \(M\left( {C_{4,n} } \right)\), see Fig. 6.
Theorem 4
Let \(M_m \left( {C_{4,n} } \right)\) be m-multiple square snake graph. Then
where \(M_1 \left( {C_{4,n} } \right) = C_{4,n}\), \(M_2 \left( {C_{4,n} } \right) = D(C_{4,n} )\) and \(M_3 \left( {C_{4,n} } \right) = T(C_{4,n} )\).
Proof
We will use a proof by induction. To prove the relation (10), for \(m = 1\), we have by definition
And from Theorem 1, we find that
For \(m = 2\) from Theorem 2, we get
On the other hand, we have
Therefore,
where \(\left\lceil {\frac{4n + 2}{3}} \right\rceil\) is TEIS for \(M_1 \left( {C_{4,n} } \right) = C_{4,n}\) from Theorem 1. Then the relation (10) is true for \(m = 2\).
Assume that the relation (10) is true for \(m = k\) i.e.
Now, we will prove that the relation (10) is true for \(m = k + 1\) i.e.
Since \(\left\lceil {\frac{4kn + 2}{3}} \right\rceil\) is TEIS for \(M_k \left( {C_{4,n} } \right)\). Then, the relation (10) is true for \(m = k + 1\). Hence, \(tes\left( {M_m \left( {C_{4,n} } \right){ }} \right) = \left\lceil {\frac{4mn + 2}{3}} \right\rceil\) for any \(m\).
3 Conclusion
In this paper, a new family of graphs called square snake graph has been defined and denoted by \(C_{4,n}\). After that, we deduced the exact value of TEISs for a square snake graph \(C_{4,n}\), double square snake graph \(D(C_{4,n} )\), triple square snake graph \(T(C_{4,n} )\) and m-multiple square snake graph \(M(C_{4,n} )\).
The main findings and major contributions of the present work are
-
1.
Square snake graph was defined.
-
2.
Related graphs of square snake graph, like double square snake graph, triple square snake graph and m-multiple square snake graph, were defined.
-
3.
The exact values of TERS for a square snake graph \(C_{4,n}\) was calculated in the form
$$ {\text{tes}}\left( {C_{4,n} } \right) = \left\lceil {\frac{4n + 2}{3}} \right\rceil . $$ -
4.
The exact values of TERS for double square snake graph \(D\left( {C_{4,n} } \right)\) was deduced and given by
$$ {\text{tes}}\left( {D\left( {C_{4,n} } \right)} \right) = \left\lceil {\frac{8n + 2}{3}} \right\rceil . $$ -
5.
The exact values of TERS for triple square snake graph \(T(C_{4,n} )\) was calculated and given in the form
$$ {\text{tes}}\left( {T\left( {C_{4,n} } \right)} \right) = \left\lceil {\frac{12n + 2}{3}} \right\rceil . $$ -
6.
The exact values of TERS for m-multiple square snake graph \(M(C_{4,n} )\) was deduced in the form
$$ {\text{tes}}\left( {M_m \left( {C_{4,n} } \right)~} \right) = \left\lceil {\frac{{4mn + 2}}{3}} \right\rceil.$$
Data availability
The manuscript has no associated data.
References
Ahmad A, Bača M (2014) Total edge irregularity strength of a categorical product of two paths. Ars Combin 114:203–212
Ahmad A, Siddiqui MK, Afzal D (2012) On the total edge irregularity strength of zigzag graphs. Aust J Comb 54:141–149
Ahmad A, Arshad M, Ižaríková G (2015) Irregular labelings of helm and sun graphs. AKCE Int J Graphs Combin 12:161–168
Ahmad A, Siddiqui MK, Ibrahim M, Asif M (2016) On the total irregularity strength of generalized Petersen graph. Math Rep 18:197–204
Al-Mushayt O, Ahmad A, Siddiqui MK (2012) On the total edge irregularity strength of hexagonal grid graphs. Australas J Comb 53:263–271
Arockiamary ST, Vistthra JM (2022) Total edge irregularity strength of some polytope structures. Adv Appl Math Sci 2022:5841–5852
Bača M, Siddiqui MK (2014) Total edge irregularity strength of generalized prism. Appl Math Comput 235:168–173
Bača M, Jendroî S, Miller M, Ryan J (2007) On irregular total labellings. Discrete Math 307(11):1378–1388
Ivanĉo J, Jendroî S (2006) Total edge irregularity strength of trees. Discus Math Graph Theory 26:449–456
Jegan R, Uijayakumar P, Thirusangu K (2022) On total edge irregularity strength of certain classes of extended duplicate graphs. J Algebraic Stat 13:634–647
Jendroî S, Miŝkuf J, Soták R (2007) Total edge irregularity strength of complete and complete bipartite graphs. Electron Notes Discrete Math 28:281–285
Jeyanthi P, Sudha A (2015) Total edge irregularity strength of disjoint union of wheel graphs. Electron Notes Discrete Math 48:175–182
Majerski P, Przybylo J (2014) On the irregularity strength of dense graphs. SIAM J Discrete Math 28:197–205
Mary VC, Suresh D, Thirusangu K (2018) Some graph labeling on the inflation of alternate triangular snake graph of odd length. Int J Math Trends Technol 2018:134–139
Naeem M, Siddiqui MK (2017) Total irregularity strength of disjoint union of isomorphic copies of Generalized Petersen graph. Discrete Math Algorithms Appl 9:1750071
Nurdini E, Rosyida I, Mulyono (2020) On total edge irregularity strength of tadpole chain graph Tr (6, n). J Phys. https://doi.org/10.1088/1742-6596/1538/1/012001
Putra RW, Susanti Y (2018) On total edge irregularity strength of centralized uniform theta Graphs. AKCE Inter J Graphs and Comb 15:7–13
Rajasingh I, Arockiamary ST (2015) Total edge irregularity strength of series parallel graphs. Int J Pure Appl Math 99:11–21
Ratnasari L, Wahyuni S, Susanti Y, Palupi D, Surodjo B (2019) Total edge irregularity strength of arithmetic book graphs. J Phys. https://doi.org/10.1088/1742-6596/1306/1/012032
Salama F (2019) On the total irregularity strength of polar grid graph. J Taibah Univ Sci 13:912–916
Salama F (2020a) Exact value of total edge irregularity strength for special families of graphs. Ann Univ Oradea Fasc Math 27:123–130
Salama F (2020b) Exact value of total edge irregularity strength for special families of graphs. Ann Univ Oradea Fasc Math 2020:26
Salama F (2021) Computing the total edge irregularity strength for quintet snake graph and related graphs. J Discrete Math Sci Cryptogr. https://doi.org/10.1080/09720529.2021.1878627
Salama F (2022) Computing total edge irregularity strength for heptagonal snake graph and related graphs. Soft Comput 26:155–164
Salama F, Abo Elanin RM (2021) On total edge irregularity strength for some special types of uniform theta snake graphs. AIMS Math 6(8):8127–8148
Salman ANM, Baskoro ET (2008) The total edge-irregular strengths of the corona product of paths with some graphs. J Comb Math Comb Comput 65:163–175
Siddiqui MK (2012) On edge irregularity strength of subdivision of star. Int J Math Soft Comput 2:75–82
Siddiqui MK, Afzal D, Faisal MR (2017) Total edge irregularity strength of accordion graphs. J Comb Optim 34:534–544
Tarawneh I, Hasni R, Ahmad A, Asim MA (2021) On the edge irregularity strength for some classes of plane graphs. AIMS Math 6:2724–2731
Tilukay MI, Salman ANM, Persulessy ER (2015) On the total irregularity strength of fan, wheel, triangular book, and friendship graphs. Proc Comput Sci 74:124–131
Yang H, Siddiqui MK, Ibrahim M, Ahmad S, Ahmad A (2018) Computing the irregularity strength of planar graphs. Mathematics 6:150
Acknowledgements
We are so grateful to the reviewer for his many valuable suggestions and comments that significantly improved the paper.
Funding
Open access funding provided by The Science, Technology & Innovation Funding Authority (STDF) in cooperation with The Egyptian Knowledge Bank (EKB).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Salama, F., Rafat, H. & Attiya, H. Total edge irregularity strength for special types of square snake graphs. Soft Comput 28, 917–927 (2024). https://doi.org/10.1007/s00500-023-09447-4
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-023-09447-4
Keywords
- Edge labeling
- Irregularity strength
- Irregular labelling
- Total edge irregularity strength
- Square snake graph