Some new results on sum index and di ff erence index

: Let G = ( V ( G ) , E ( G )) be a graph with a vertex set V ( G ) and an edge set E ( G ). For every injective vertex labeling f : V ( G ) → Z , there are two induced edge labelings denoted by f + : E ( G ) → Z and f − : E ( G ) → Z . These two edge labelings f + and f − are defined by f + ( uv ) = f ( u ) + f ( v ) and f − ( uv ) = | f ( u ) − f ( v ) | for each uv ∈ E ( G ) with u , v ∈ V ( G ). The sum index and di ff erence index of G are induced by the minimum ranges of f + and f − , respectively. In this paper, we obtain the properties of sum and di ff erence index labelings. We also improve the bounds on the sum indices and di ff erence indices of regular graphs and induced subgraphs of graphs. Further, we determine the sum and di ff erence indices of various families of graphs such as the necklace graphs and the complements of matchings, cycles and paths. Finally, we propose some conjectures and questions by comparison.


Introduction
Let G = (V(G), E(G)) be a simple graph, where V(G) is the set of vertices of G and E(G) is the set of edges of G. Two edges e 1 and e 2 of G are adjacent, if they have exactly one common end vertex (otherwise, e 1 and e 2 of G are non-adjacent).If e = {u, v} is an edge of G, then u and v are adjacent while u and e are incident.If all the vertices of G have the same degree d, then G is d-regular and its degree sequence is π The complement of G denoted by G, is the simple graph whose vertex set is V(G) and whose edges are the pairs of non-adjacent vertices of G.A matching of a graph G is a set of pairwise non-adjacent edges in E(G).A m-matching is a matching consisting of m edges denoted by mK 2 .As usual, we use P n and C n to denote the path and cycle of order n, respectively.
Let f : V (G) → Z be an injective vertex labeling of G.There are two edge labelings of G induced by f , which are defined as f + : E (G) → Z and f − : E (G) → Z.For each edge uv ∈ E(G), two edge labelings f + (uv) and f − (uv) are defined by The sum index s(G) and difference index d(G) of G are defined by the minimum ranges of f + and f − of G, respectively.They were introduced by Harrington et al. in [1].To avoid much ambiguity, we denote f − by g − .The injective vertex labeling corresponding to g − is denoted by g throughout the article.
Definition 1.1.[1] The sum index of G, denoted by s(G), is the minimum positive integer k such that there exists a vertex labeling f of G satisfying | f + | = k, where | f + | is the range of f .A vertex labeling f such that | f + | = s(G) is referred to as a sum index labeling of G. Degree-based indices are served as meaningful models for a broad range of applications.For example, the Randić index [2] is denoted by where d G (u) is the degree of the vertex u ∈ V(G).The Randić index has great applications in modeling the properties of certain molecular structures.As another important degree-based topological index, the Sombor index [3] is used to model the higher-order interactions represented by clique structures and defined by The atom-bond connectivity (ABC) index of G has proven to be a valuable predictive index in the study of the heat of function in alkanes [4,5] and defined by In graph theory, regular graphs are one of the most important classes of graphs.Let G 0 be d-regular with order n.Then the above three indices are . Moreover, the first Zagreb index [6], the variable sum exdeg index [7], the Harmonic index [8] and so on are all widely used in graphs including regular graphs.
Graph indices derived from graph labelings are also of great value in coding theory, radar, circuit design, data base management and among others.The notations of the (integral) sum labelings of graphs were introduced by F. Harary in [9].Since that time the problems of finding the (integral) sum numbers and proving the (integral) sum graphs have been studied and discussed by scholars referring to [10,11].A graph G is called an (integral) sum graph if there is a bijection f from V(G) to S ⊂ (Z) N such that xy ∈ E(G) if and only if f (x) + f (y) ∈ S .The (integral) sum number of G is the minimum number of isolated vertices that must be added to G such that the resulting graph is an (integral) sum graph.
Based on the above, graph labelings of graphs attracted lots of attention of researchers.For example, the vertex-magic total labelings were introduced by MacDougall, Miller, Slamin and Wallis in [12].Ponraj and Parthipan posited pair sum labelings in [13].Harrington and Wong used super totient numbers to label vertices of graphs and found that the restricted super totient indices of graphs were equal to their sum indices in [14].In this regard, Harrington, Henninger-Voss et al. defined the sum indices and difference indices of graphs and lower bounds on these two indices were also determined in [1].Further, both the sum and difference indices of several graphs were also obtained such as the complete graphs, complete bipartite graphs, caterpillars, cycles, wheels and rectangular grids in [1].Besides, Haslegrave improved bounds on these two indices in [15].
Up to now, some useful results about the sum indices and difference indices of graphs are shown as follows.
Property 1.1.[14] The sum index is greater than or equal to the maximum degree of G, s(G) ≥ ∆(G).Property 1.2.[1] The sum index is greater than or equal to the chromatic index of G, s(G) ≥ χ ′ (G).Property 1.3.[1] Let δ(G) be the minimum degree of G, and recall that χ ′ (G) is the chromatic index of G. Then we have Property 1.4.[15] For any graph G, we have In this paper, we continue to study the sum indices and difference indices of graphs.Firstly, we improve some bounds on the sum and difference indices in Section 2. In particular, we find relationships about these two indices between a graph G and its induced subgraph G ′ .For regular graphs, we make slight generalizations of Haslegrave's bounds on the sum and difference indices in [15].Secondly, we obtain the sum and difference indices of some graphs in Section 3 such as the necklace graphs, the complements of matchings, cycles and paths.Finally, we compare the sum indices with (integral) sum numbers and analyze the sum and difference indices of regular graphs.Combined with conclusions of the paper, we also put forward some conjectures and open questions.

Properties and bounds of sum indices and difference indices of graphs
In this section, we explore the properties of sum index labelings and difference index labelings of graphs.We also improve the bounds on the sum and difference indices of regular graphs and induced subgraphs of graphs.In particular, we make slight improvements to Property 1.4 such that we can directly determine lower bounds on the sum indices and difference indices of regular graphs.
Theorem 2.1.If f is a sum index labeling of G, then k f is also a sum index labeling of G for any non-zero integer.The result holds for a difference index labeling g as well. Proof.
Hence we observe that Thus k f is also a sum index labeling of G. □ Remark 2.1.For a graph G, the sum index of G is unique, while the number of corresponding sum index labelings is infinite.
Note that G is a d-regular graph.Then the sum of the two numbers above has at most 2(n − 1 − d) elements which do not belong to f + .Thus, we obtain Next, we will show that d(G) ≥ d.Let g = f be an injective vertex labeling of G. Without loss of generality, we assume that the vertex labeled a 1 is adjacent to vertices labeled a 2 , a 3 , • • • , a d+1 .By utilizing the definition of d(G), we have d(G) ≥ d. □ Remark 2.2.Theorem 2.3 is viewed as slight generalizations of Haslegrave's bounds on the sum and difference indices of graphs in [15] (see Property 1.4).

Sum indices and difference indices of some graphs
In this section, we discuss the sum indices and difference indices of some graphs such as the necklace graphs, the complements of matchings, cycles and paths.At the beginning, we introduce a difinition about the edge labeling of a graph that will be needed in the remaining part of the paper.Definition 3.1.For two edge labelings f + and g − of G, the contributing elements of f + are the elements first appearing in f + .For each edge v i v j ∈ E(G), let f ′+ v i v j be a contributing set of f + , which is a set of all contributing elements of f + .Define f ′+ v i v j as contributions corresponding to f The definitions of g ′− v i v j and g ′− v i v j are similar to f ′+ v i v j and f ′+ v i v j , respectively.
According to Definition 3.1, it is not difficult to find that For the matching mK 2 with m ≥ 1, we have s(mK 2 ) = 1 and d(mK 2 ) = 1.The inverse problem is also true. where ) and b i b i+1 ∈ E(N ek ) (see Figure 1).It is clear to see that under the vertex labeling f we have On the other hand, we will show that d(N ek ) = 3.Since we know d(N ek ) ≥ 3 by Theorem 2.3, it suffices to find a vertex labeling g such that |g − | = 3.
Let g : V(N ek ) → Z be an injective vertex labeling of N ek .For 1 ≤ i ≤ k, we consider the vertex labeling g defined such that g We illustrate the vertex labelings f and g of N e4 , respectively (see Figure 2).□ Proof.Throughout this proof, since the complement of a matching mK 2 is (n − 2)-regular.The degree sequence of According to the properties of degree sequence, we know v∈V(G) d G (v) = 2|E|.It implies that n is even.Firstly, we discuss the sum index of mK 2 .By Theorem 2.3, we have s(mK 2 ) ≥ 2n − 5. Then we just find a vertex labeling f such that where v j v j+1 E(mK 2 ) and v n+1 = v 1 for 2 ≤ j ≤ n and j is even.
According to the labeling f and Definition 3.1, we observe that the following three equations hold.
Except the above contributions corresponding three contributing sets, the sum of other contributions of f + is equal to 0. Therefore we know Next, we consider the difference index of mK 2 .Note that d(mK 2 ) ≥ n − 2 by Theorem 2.3.It remains to show that d(mK 2 ) ≤ n − 2. Let g : V(mK 2 ) → Z be an injective labeling, where g(v i ) = f (v i ) for 1 ≤ i ≤ n.We assume that all vertices of mK 2 satisfy v j v j+1 E(mK 2 ), when j is odd and 1 ≤ j ≤ n − 1.
By Definition 3.1, it holds that The sum of other contributions of g − is equal to 0, if the contributions corresponding two contributing sets above are excluded.Thus we have We illustrate the vertex labelings f and g of 6K 2 , respectively (see Figure 3).□ Figure 3.A sum index labeling f and a difference index labeling g of 6K 2 .
Next, we achieve the following theorems of the complements of a cycle C n and a path P n relating to sum and difference indices, respectively.
In what follows, we distinguish two cases according to the parity of n.Case 1.If n is even.
In this case, we assume that Except the above contributions corresponding three contributing sets, the sum of other contributions of f + is equal to 0. Therefore we obtain The sum of other contributions of f + is equal to 1, if the contributions above are excluded.Thus based on the definition of the sum index, we obtain We illustrate the sum index labelings f of C 7 and C 8 , respectively (see Figure 4).On the other hand, we consider the difference index of Below, we distinguish two cases according to the parity of n.Case 1.If n is even.
If n is even, then we assume that In addition, Definition 3.1 enables us to ensure that The sum of other contributions of g − is equal to 0, if the contributions corresponding two contributing sets above are excluded.Thus, we have Except the above contributions corresponding two contributing sets, the sum of other contributions of g − is equal to 0. It is clear to see that under the vertex labeling g we have We illustrate difference index labelings g of C 7 and C 8 , respectively (see Figure 5).Proof.In this proof, let P n be the complement of a path P n for n ≥ 6.Then its degree sequence is Firstly, we discuss the sum index of P n .Property 1.4 implies that s(P n ) ≥ 2n − 6.Then it remains to show that s(C n ) ≤ 2n − 7 by defining vertex labeling f such that Below, we distinguish two cases according to the parity of n.Case 1.If n is even.
If n is even, then we assume that v 1 v 2 E(P n ) and v n−1 v n E(P n ).And for each 1 ≤ m ≤ n−2 2 , all vertices of P n satisfy v 2m v 2m+2 E(P n ) and v 2m−1 v 2m+1 E(P n ).
By Definition 3.1, we note that We find that except the above contributions corresponding three contributing sets, the sum of other contributions of f + is equal to 0. Thus we obtain Case 2. If n is odd.
If n is odd, then we assume that v 1 v 2 ∈ E(P n ), v 1 v 3 E(P n ) and v n−1 v n E(P n ).And for each 1 ≤ m ≤ n−3 2 , all vertices of P n satisfy v 2m v 2m+2 E(P n ) and v 2m+1 v 2m+3 E(P n ).By Definition 3.1, it holds that We claim that except the above contributions corresponding three contributing sets, the sum of other contributions of f + is equal to 1.
As a result, we have We illustrate sum index labelings f of P 7 and P 8 , respectively (see Figure 6).Next, we consider the difference index of P n .We have n ) ≥ n − 3 by Property 1.4, which means that we just find a vertex labeling g such that |g − | = n − 3 in the following.We distinguish two cases according to the parity of n.Case 1.If n is even.
Let g : V(P n ) → Z be an injective labeling of P n such that In this case, we assume that 2 , all vertices of P n satisfy v 2m v 2m+2 E(P n ) and v 2m−1 v 2m+1 E(P n ).
According to Definition 3.1, we have Since the sum of other contributions of g − is equal to 0 excepting the above contributions.
As a result, it holds that Case 2. If n is odd.Let g : V(P n ) → Z be an injective labeling.For 1 ≤ i ≤ n, we define g of P n as In this case, we assume that 2 .Hence, according to Definition 3.1, it follows that The sum of other contributions of g − is equal to 0 excepting the above contributions corresponding two contributing sets.
As a result, we have We illustrate difference index labelings g of P 7 and P 8 , respectively (see Figure 7).□ Figure 7. Difference index labelings g of P 7 and P 8 .

Conclusions
In this article, we first obtain the properties of sum index labelings and difference index labelings.We also improve the sharp lower bounds on sum and difference indices of generalized regular graphs.In this regard, the sum indices and difference indices of the necklace graphs and the complements of matchings, cycles and paths are determined.Finally, we compare the sum indices with the (integral) sum numbers of several types of graphs and find that there are certain relationships in this section (see Table 1).
According to the sum indices and difference indices of regular graphs in this paper, the values of two invariants of a part of known regular graphs are listed in Table 2. Preliminary investigations on regular graphs lead us to the following conjecture.Nowadays, the problems of the (integral) sum numbers have been studied comprehensively, while the problems of the sum and difference indices of graphs constitute challenges for researchers in graph labeling theory.Based on Table 1, we find that there exist certain relationships between the sum indices and the (integral) sum numbers of graphs.Of course, the current manuscript defines a starting point for the study of the sum and difference indices of regular graphs.However, a much deeper study is required to determine these two invariants of more graph families including regular graphs.Thus it would be interesting to find solutions to the questions below.

Use of AI tools declaration
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

Definition 1 . 2 .
[1] Let g : V(G) → Z be a vertex labeling of G, and let g − : E(G) → Z be the induced edge labeling defined by g− (uv) = |g(u) − g(v)| for each edge uv ∈ E(G).The difference index of G, denoted by d(G), is the minimum positive integer k such that there exists a vertex labeling g of G satisfying |g − | = k, where |g − | is the range of g.A vertex labeling g such that |g − | = d(G) is referred to as a difference index labeling of G.

Figure 2 . 3 . 3 . 2 .
Figure 2. A sum index labeling f and a difference index labeling g of N e4 .

Theorem 3 . 3 .
The complement of a cycle C n , or briefly by C n , is (n − 3)-regular for n ≥ 6. Thens(C n ) = 2n − 7 and d(C n ) = n − 3.Proof.To begin with, we consider the sum index of C n .By Theorem 2.3, we have s(C n ) ≥ 2n − 7. It remains to show that s(C n ) ≤ 2n−7 by defining a vertex labeling f such that |

Figure 4 .
Figure 4. Sum index labelings f of C 7 and C 8 .

Figure 5 .
Figure 5. Difference index labelings g of C 7 and C 8 .

Figure 6 .
Figure 6.Sum index labelings f of P 7 and P 8 .

4 ) 4 . 1 .Problem 4 . 2 .
2n − 7(n ≥ 6) 2n − 7(n ≥ 7) 2n − 7(n ≥ 7) complements of matchings 2n − 5(n ≥ 4) 2n − 5(n ≥ 7) 2n − 5(n ≥ 7) complete graphs 2n − 3 (n ≥ 2) 2n − 3(n ≥ 4) 2n − 3(n ≥ Problem What are the specific relationships between the (integral) sum numbers and sum indices, or in what graphs do these relationships exist referring to Table 1?As we all know, the generalized Peterson graphs have been extensively investigated as many nice structural and algorithmic properties.Determine the sum and difference indices of generalized Peterson graphs, which are 3-regular.Problem 4.3.The torus grid graph is the graph formed from the Cartesian product C m × C n of the cycle graphs C m and C n .Try to determine the sum and difference indices of torus grid graphs, which are 4-regular.

Table 1 .
Comparing sum index with (integral) sum number.

Table 2 .
The sum index and difference index of regular graphs.