Next Article in Journal
Mathematics, Cryptocurrencies and Blockchain Technology
Previous Article in Journal
The Complexity of Cryptocurrencies Algorithmic Trading
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Linear Forest mP3 Plus a Longer Path Pn Becoming Antimagic

1
Department of Marketing, Kainan University, Luzhu Dist., Taoyuan City 33857, Taiwan
2
Academy of Preparatory Programs for Overseas Chinese Students, National Taiwan Normal University, Linkou Dist., New Taipei City 24449, Taiwan
*
Author to whom correspondence should be addressed.
Submission received: 19 April 2022 / Revised: 5 June 2022 / Accepted: 9 June 2022 / Published: 12 June 2022

Abstract

:
An edge labeling of a graph G is a bijection f from E ( G ) to a set of | E ( G ) | integers. For a vertex u in G, the induced vertex sum of u, denoted by f + ( u ) , is defined as f + ( u ) = u v E ( G ) f ( u v ) . Graph G is said to be antimagic if it has an edge labeling g such that g ( E ( G ) ) = { 1 , 2 , , | E ( G ) | } and g + ( u ) g + ( v ) for any pair u , v V ( G ) with u v . A linear forest is a union of disjoint paths of orders greater than one. Let m P k denote a linear forest consisting of m disjoint copies of path P k . It is known that m P 3 is antimagic if and only if m = 1 . In this study, we add a disjoint path P n ( n 4 ) to m P 3 and develop a necessary condition and a sufficient condition whereby the new linear forest m P 3 P n may be antimagic.

1. Introduction and Preliminaries

An edge labeling of a graph G is a bijection f from E ( G ) to a set of | E ( G ) | integers. For a vertex u in G, the induced vertex sum of u, denoted by f + ( u ) , is defined as f + ( u ) = u v E ( G ) f ( u v ) . Graph G is said to be antimagic if it has an edge labeling g such that g ( E ( G ) ) = { 1 , 2 , , | E ( G ) | } and g + ( u ) g + ( v ) for any pair u , v V ( G ) with u v . Such an edge labeling g is called an antimagic labeling of G. Hartsfield and Ringel introduced antimagic graphs in 1990 [1]. They showed that paths P n ( n 3 ) , cycles C n ( n 3 ) , wheels, and complete graphs K n ( n 3 ) are antimagic. Moreover, they have the following conjecture. Conjecture A: All connected graphs, except for K 2 , are antimagic. Although many types of connected graphs have been verified to be antimagic in recent decades [1,2,3,4,5,6,7,8,9,10,11,12,13,14], Conjecture A remains open. As an extension, we study the antimagicness of disconnected graphs. We now list several known results as follows. For n N , a star S n is a complete bipartite graph K 1 , n . Let A B denote the union of disjoint graphs A and B, and m G the union of m disjoint copies of graph G. Wang et al. [15] proved that 2 P n + 1 , m S n ( m 1 ) , S n P n , and S n P n + 1 are antimagic for n 3 , and C n S k is antimagic for n 3 and k 2 n + 2 . A star forest is a union of disjoint stars. It is obvious that any star forest containing S 1 as its component is not antimagic. Ref. [15] shows that a star forest m S 2 is antimagic if and only if m = 1 . An S k -free star forest is a star forest without any star S k as its component. Shang et al. [16] proved that an S 1 -free star forest containing at most one S 2 as its component is antimagic. In addition, they added a star S n ( n 3 ) to m S 2 and proved that the star forest m S 2 S n is antimagic if and only if m min { 2 n + 1 , 2 n 5 + 8 n 2 24 n + 17 2 } . Chen et al. [17] used a different labeling method to show that m S 2 S n ( n 3 ) is antimagic if and only if n max { m 1 2 , 1 2 m + 8 m 2 + 16 m + 9 2 } . These two results are equivalent as m min { 2 n + 1 , 2 n 5 + 8 n 2 24 n + 17 2 } if and only if n max { m 1 2 , 1 2 m + 8 m 2 + 16 m + 9 2 } for m , n N . Chen et al. also proposed a necessary condition and a sufficient condition for a star forest m S 2 S n 1 S n 2 S n k ( n 1 , n 2 , , n k 3 ) to be antimagic. In addition, they showed that a star forest with an extra disjoint path is antimagic. A linear forest is a union of disjoint paths of orders greater than one. A P k -free linear forest is a linear forest without any path P k as its component. Shang [18] showed that P 2 , P 3 , P 4 -free linear forests are antimagic. Furthermore, Shang [19] achieved a progressive result showing that P 2 , P 3 -free linear forests are antimagic. As m P 3 is isomorphic to m S 2 , it is seen that m P 3 is antimagic if and only if m = 1 . A graph G is said to be k-shifted antimagic ( k Z ) if it has an edge labeling f such that f ( E ( G ) ) = { k + 1 , k + 2 , , k + | E ( G ) | } and f + ( u ) f + ( v ) for any pair u , v V ( G ) with u v . From the definition we see that an antimagic graph is 0-shifted antimagic. Graph G is called absolutely antimagic if it is k-shifted antimagic for any k Z . Recently, Dhananjaya and Li [20] extended the results in [16,18] showing that S 1 , S 2 -free star forests and P 2 , P 3 , P 4 -free linear forests are absolutely antimagic. Moreover, they proved that the odd tree forests are absolutely antimagic.
Since any graph containing P 2 as component is not antimagic, and [19] shows that P 2 , P 3 -free linear forests are antimagic, the following problem is naturally raising: How many disjoint paths P 3 can be added to a P 2 , P 3 -free linear forest such that the extended new linear forest is still antimagic? This problem might not be very easy to answer. Hence, this study begins with the following smaller topic: For a non-antimagic linear forest m P 3 ( m 2 ), we add a longer path P n ( n 4 ) to it and investigate the antimagicness of m P 3 P n . In the following section, we will develop a necessary condition and a sufficient condition whereby the linear forest m P 3 P n may be antimagic.

2. Conditions for m P 3 P n ( n 4 ) to Be Antimagic

It is known that the linear forest m P 3 is antimagic if and only if m = 1 [15]. However, with an extra path P n ( n 4 ) added to m P 3 ( m 2 ), the linear forest m P 3 P n may be antimagic. In [18], it was conjectured that if m P 3 P 4 is antimagic then m 2 . This conjecture is correct, and in the following we prove a necessary condition for the linear forest m P 3 P n ( n 4 ) to be antimagic.
Theorem 1.
For n 4 , if the linear forest m P 3 P n is antimagic, then m 2 n 7 + 8 n 2 40 n + 49 2 .
Proof. 
We first let f : E ( m P 3 P n ) { 1 , 2 , , 2 m + n 1 } be an antimagic labeling of m P 3 P n . It is observed that in m P 3 P n there are n 3 edges whose both ends are vertices of degree two. Now suppose that these n 3 edges receive labels 1 , 2 , , n 3 under labeling f, where 1 < 2 < < n 3 . Next, we designate the vertices of degree two in m P 3 P n as z 1 , z 2 , , z m + n 2 . We now evaluate the summation of the vertex sums f + ( z 1 ) , f + ( z 2 ) , , f + ( z m + n 2 ) . It is evident that
i = 1 m + n 2 f + ( z i ) = i = 1 2 m + n 1 i + i = 1 n 3 i .
Next, let A = { f + ( u ) | u V ( m P 3 P n ) and u has degree one } . It is evident that A = { 1 , 2 , , 2 m + n 1 } { 1 , 2 , , n 3 } . Now, let b i be the i-th least number in the set { f + ( z 1 ) , f + ( z 2 ) , , f + ( z m + n 2 ) } , for i = 1 , 2 , , m + n 2 . Since all vertices have distinct vertex sums under the antimagic labeling f, we have b i A for i = 1 , 2 , , m + n 2 . That is, b i { 1 , 2 , , n 3 } { k N | k 2 m + n } . Then,
b i i , for i = 1 , 2 , , n 3 , and
b i 2 m + 2 + i , for i = n 2 , n 1 , , m + n 2 .
Hence,
i = 1 m + n 2 b i i = 1 n 3 i + i = n 2 m + n 2 ( 2 m + 2 + i ) .
As i = 1 m + n 2 f + ( z i ) = i = 1 m + n 2 b i , according to (1) and (2), we have
i = 1 2 m + n 1 i i = n 2 m + n 2 ( 2 m + 2 + i )
Then, we have
m 2 ( 2 n 7 ) m + 3 n n 2 0 ( m 2 n 7 2 ) 2 8 n 2 40 n + 49 4 0 , where 8 n 2 40 n + 49 > 0 , for n 4 ( m 2 n 7 8 n 2 40 n + 49 2 ) ( m 2 n 7 + 8 n 2 40 n + 49 2 ) 0 m 2 n 7 + 8 n 2 40 n + 49 2 .
To develop a sufficient condition for m P 3 P n to be antimagic, we now designate the vertices in m P 3 P n as follows: The i-th copy of the path P 3 in m P 3 P n is denoted by x i z i y i ; the path P n is denoted by
u 1 u 2 u 3 u n 2 2 u n 2 1 u n 2 v n 2 v n 2 1 v n 2 2 v 3 v 2 v 1 .
The following Figure 1 shows the case where P n has an odd order n.
For the linear forest m P 3 P n , where m 2 and n m + 4 , we define a function f on E ( m P 3 P n ) as follows:
f ( x 2 i 1 z 2 i 1 ) = 6 ( i 1 ) + 1 , 1 i m 2 , f ( z 2 i 1 y 2 i 1 ) = 6 ( i 1 ) + 2 , 1 i m 2 , f ( x 2 i z 2 i ) = 6 ( i 1 ) + 4 , 1 i m 2 , f ( z 2 i y 2 i ) = 6 ( i 1 ) + 5 , 1 i m 2 , f ( u i u i + 1 ) = 6 ( i 1 ) + 3 , 1 i m 2 , f ( v i v i + 1 ) = 6 ( i 1 ) + 6 , 1 i m 2 , f ( u m 2 + 1 u m 2 + 2 ) = 2 m + 2 m 2 + 1 , f ( u i u i + 1 ) + 1 = f ( v i v i + 1 ) , m 2 + 1 i n 2 1 , f ( v i v i + 1 ) + 1 = f ( u i + 1 u i + 2 ) , m 2 + 1 i n 2 1 , but   i n 2 1 , f ( u n 2 v n 2 ) = 2 m + n 1 .
We see that
( i = 1 m { f ( x i z i ) , f ( z i y i ) } ) ( i = 1 m 2 { f ( u i u i + 1 ) , f ( v i v i + 1 ) } ) = { 1 , 2 , , 2 m + 2 m 2 } ,
and
( i = m 2 + 1 n 2 1 { f ( u i u i + 1 ) } ) ( i = m 2 + 1 n 2 1 { f ( v i v i + 1 ) } ) { f ( u n 2 v n 2 ) } = { 2 m + 2 m 2 + 1 , 2 m + 2 m 2 + 2 , , 2 m + n 1 } .
That is, f : E ( m P 3 P n ) { 1 , 2 , , 2 m + n 1 } is an edge labeling of m P 3 P n . From the labeling f the following is observed: f + ( x 2 i 1 ) 1 mod 6 , f + ( y 2 i 1 ) 2 mod 6 , f + ( x 2 i ) 4 mod 6 , f + ( y 2 i ) 5 mod 6 and f + ( z i ) 3 mod 6 . And f + ( u i ) f + ( v j ) 0 mod 6 if i , j m 2 except for f + ( u 1 ) = 3 . This labeling strategy helps vertices of m P 3 P n obtaining distinct vertex sums with an only exception. As an example, for the linear forest 7 P 3 P 11 , Figure 2 shows the edge labels and vertex sums under f. We note that the number beside an edge is the label of this edge, and the number above a vertex is the induced vertex sum of this vertex.
In Figure 2, we see that the induced vertex sums of all vertices in 7 P 3 P 11 are almost distinct, except for f + ( z 1 ) = f + ( u 1 ) = 3 . Therefore, we have the following lemma.
Lemma 1.
Suppose that f is the aforementioned edge labeling of the linear forest m P 3 P n , where m 2 and n m + 4 . Then, for any pair of distinct vertices x and y in m P 3 P n , we have f + ( x ) f + ( y ) , except for f + ( z 1 ) = f + ( u 1 ) = 3 .
Proof. 
We first consider the case of m 4 . According to the definition of f, we have the following.
(i)
f + ( z 1 ) = f + ( u 1 ) = 3 .
(ii)
f + ( x 2 i 1 ) 1 mod 6 , f + ( y 2 i 1 ) 2 mod 6 , f + ( x 2 i ) 4 mod 6 , f + ( y 2 i ) 5 mod 6 , and f + ( x 1 ) < f + ( y 1 ) < f + ( x 2 ) < f + ( y 2 ) < < f + ( x m ) < f + ( y m ) .
(iii)
f + ( z 2 i 1 ) = 6 ( 2 i 2 ) + 3 , f + ( z 2 i ) = 6 ( 2 i 1 ) + 3 . That is, f + ( z j ) 3 mod 6 , and f + ( z 1 ) < f + ( z 2 ) < < f + ( z m ) .
(iv)
For 2 i m 2 , we have f + ( u i ) = 6 ( 2 i 2 ) and f + ( v i ) = 6 ( 2 i 1 ) . That is, for 2 i , j m 2 , f + ( u i ) f + ( v j ) 0 mod 6 . In addition, for f + ( v m 2 ) = 12 m 2 6 , f + ( u m 2 + 1 ) = 2 m + 8 m 2 2 , we see that f + ( v m 2 ) < f + ( u m 2 + 1 ) . Then, we have 6 = f + ( v 1 ) < f + ( u 2 ) < f + ( v 2 ) < f + ( u 3 ) < f + ( v 3 ) < < f + ( u m 2 ) < f + ( v m 2 ) < f + ( u m 2 + 1 ) . Further, it is evident that f + ( u m 2 + 1 ) < f + ( v m 2 + 1 ) < f + ( u m 2 + 2 ) < f + ( v m 2 + 2 ) < < f + ( u n 2 ) < f + ( v n 2 ) . And f + ( v n 2 ) < f + ( u n 2 ) if n is odd.
Now, let A = i = 1 m { x i , y i , z i } , B = { v 1 } ( i = 2 m 2 { u i , v i } ) , and C = ( i = m 2 + 1 n 2 { u i } ) ( j = m 2 + 1 n 2 { v j } ) . We see that A, B, and C are subsets of V ( m P 3 P n ) , and A B C = V ( m P 3 P n ) { u 1 } . According to (ii)∼(iv) above, it can be seen that f + ( u ) are distinct for all u A B , and f + ( v ) are distinct for all v B C . To show that this lemma holds, it suffices to show that f + ( A ) f + ( C ) = ϕ . We distinguish the following two subcases: m is odd and m is even.
Subcase 1: m is odd. We evaluate f + ( z m 1 ) , f + ( z m ) , f + ( u m 2 + 1 ) , and f + ( v m 2 + 1 ) . f + ( z m 1 ) = f ( x m 1 z m 1 ) + f ( z m 1 y m 1 ) = 6 ( m 1 2 1 ) + 4 + 6 ( m 1 2 1 ) + 5 = 6 m 9 . f + ( z m ) = f ( x m z m ) + f ( z m y m ) = 6 ( m + 1 2 1 ) + 1 + 6 ( m + 1 2 1 ) + 2 = 6 m 3 , and f + ( u m 2 + 1 ) = 2 m + 8 m 2 2 = 6 m 6 , and f + ( v m 2 + 1 ) = 2 m + 8 m 2 + 2 = 6 m 2 . It can be seen that f + ( z m 1 ) , f + ( z m ) are the two greatest numbers in the set f + ( A ) , and f + ( u m 2 + 1 ) , f + ( v m 2 + 1 ) are the two least numbers in the set f + ( C ) . As f + ( z m 1 ) < f + ( u m 2 + 1 ) < f + ( z m ) < f + ( v m 2 + 1 ) , we have f + ( A ) f + ( C ) = ϕ .
Subcase 2: m is even. We evaluate f + ( z m ) and f + ( u m 2 + 1 ) . f + ( z m ) = f ( x m z m ) + f ( z m y m ) = 6 ( m 2 1 ) + 4 + 6 ( m 2 1 ) + 5 = 6 m 3 , and f + ( u m 2 + 1 ) = 2 m + 8 m 2 2 = 6 m 2 . It can be seen that f + ( z m ) is the greatest number in f + ( A ) , and f + ( u m 2 + 1 ) is the least number in f + ( C ) . As f + ( z m ) < f + ( u m 2 + 1 ) , we have f + ( A ) f + ( C ) = ϕ .
From the two subcases we see that f + ( A ) f + ( C ) = ϕ . Thus the lemma holds for the case of m 4 .
The cases m = 2 and m = 3 are shown in the following figures (Figure 3 and Figure 4).
The proof for this part is simple, we leave it to the readers. □
In the following lemma, we modify the labeling f stated in Lemma 1 to obtain an antimagic labeling for the linear forest m P 3 P n , where m 4 and n m + 5 .
Lemma 2.
For m 4 and n m + 5 , linear forest m P 3 P n is antimagic.
Proof. 
Let f be the edge labeling of m P 3 P n which is defined as in Lemma 1. Recall that P n is the path u 1 u 2 u 3 u n 2 v n 2 v 3 v 2 v 1 . We distinguish the two cases m = 2 k + 1 and m = 2 k , where k 2 .
Case 1. m = 2 k + 1 and k 2 . In this case, we see that n 2 k + 3 . Now, we define a function f 1 on E ( m P 3 P n ) as
f 1 ( x 1 z 1 ) = f ( u k + 2 u k + 3 ) = 6 k + 5 , f 1 ( u k + 2 u k + 3 ) = f ( x 1 z 1 ) = 1 , f 1 ( e ) = f ( e ) for   every   other   edge   e .
Evidently, f 1 is an edge labeling of m P 3 P n , and f 1 + ( x ) = f + ( x ) for all x V ( m P 3 P n ) { x 1 , z 1 , u k + 2 , u k + 3 } . Let P = { x 1 , z 1 , u k + 2 , u k + 3 } , and Q = V ( m P 3 P n ) P . According to Lemma 1, f 1 + ( x ) are distinct for all x Q . Now, we evaluate f 1 + ( y ) for all y P . Note that f 1 ( u k + 1 u k + 2 ) = 6 k + 3 and f 1 ( u k + 3 u k + 4 ) = 6 k + 7 , or f 1 ( u k + 3 v k + 3 ) = 6 k + 7 if n = 2 k + 6 . Then, f 1 + ( x 1 ) = f 1 ( x 1 z 1 ) = 6 k + 5 , f 1 + ( z 1 ) = f 1 ( x 1 z 1 ) + f 1 ( z 1 y 1 ) = ( 6 k + 5 ) + 2 = 6 k + 7 , f 1 + ( u k + 2 ) = f 1 ( u k + 1 u k + 2 ) + f 1 ( u k + 2 u k + 3 ) = ( 6 k + 3 ) + 1 = 6 k + 4 , and f 1 + ( u k + 3 ) = f 1 ( u k + 2 u k + 3 ) + f 1 ( u k + 3 u k + 4 ) (or f 1 ( u k + 3 v k + 3 ) ) = 1 + ( 6 k + 7 ) = 6 k + 8 . It is observed that f 1 + ( y ) are distinct for all y P . To show that f 1 + ( x ) are distinct for all x V ( m P 3 P n ) , it suffices to show that f 1 + ( P ) f 1 + ( Q ) = ϕ . Firstly, we divide Q into two parts, A and B, where A = { y 1 } ( i = 2 2 k + 1 { x i , y i , z i } ) ( i = 1 k { u i , v i } ) and B = Q A . We now claim that f 1 + ( P ) f 1 + ( A ) = ϕ . From the proof of Lemma 1, it can be seen that the values f 1 + ( x 2 k + 1 ) = 6 k + 1 , f 1 + ( y 2 k + 1 ) = 6 k + 2 , f 1 + ( x 2 k ) = 6 k 2 , and f 1 + ( y 2 k ) = 6 k 1 are the greatest numbers in f 1 + ( A ) congruent to 1, 2, 4, and 5 modulo 6, respectively. As f 1 + ( z 1 ) 1 mod 6 and f 1 + ( z 1 ) > f 1 + ( x 2 k + 1 ) , f 1 + ( u k + 3 ) 2 mod 6 and f 1 + ( u k + 3 ) > f 1 + ( y 2 k + 1 ) , f 1 + ( u k + 2 ) 4 mod 6 and f 1 + ( u k + 2 ) > f 1 + ( x 2 k ) , and f 1 + ( x 1 ) 5 mod 6 and f 1 + ( x 1 ) > f 1 + ( y 2 k ) , we have f 1 + ( P ) f 1 + ( A ) = ϕ . Next, we claim that f 1 + ( P ) f 1 + ( B ) = ϕ . Evidently, f 1 + ( u k + 1 ) = f 1 ( u k u k + 1 ) + f 1 ( u k + 1 u k + 2 ) = ( 6 k 3 ) + ( 6 k + 3 ) = 12 k is the least number in f 1 + ( B ) , and f 1 + ( u k + 3 ) = 6 k + 8 is the greatest number in f 1 + ( P ) . As f 1 + ( u k + 1 ) > f 1 + ( u k + 3 ) when k 2 , we have f 1 + ( P ) f 1 + ( B ) = ϕ . Thus, f 1 + ( P ) f 1 + ( Q ) = ϕ .
Case 2. m = 2 k and k 2 . In this case, we see that n 2 k + 3 and n 2 k + 2 . Now, we define a function f 2 on E ( m P 3 P n ) as
f 2 ( x 1 z 1 ) = f ( v k + 1 v k + 2 ) = 6 k + 2 , f 2 ( v k + 1 v k + 2 ) = f ( x 1 z 1 ) = 1 , f 2 ( e ) = f ( e ) for   every   other   edge   e .
Evidently, f 2 is an edge labeling of m P 3 P n , and f 2 + ( x ) = f + ( x ) for all x V ( m P 3 P n ) { x 1 , z 1 , v k + 1 , v k + 2 } . Let P = { x 1 , z 1 , v k + 1 , v k + 2 } , and Q = V ( m P 3 P n ) P . According to Lemma 1, f 2 + ( x ) are distinct for all x Q . Now, we evaluate f 2 + ( y ) for all y P . Note that f 2 ( v k v k + 1 ) = 6 k and f 2 ( v k + 2 v k + 3 ) = 6 k + 4 , or f 2 ( v k + 2 u k + 3 ) = 6 k + 4 if n = 2 k + 5 . Then, f 2 + ( x 1 ) = f 2 ( x 1 z 1 ) = 6 k + 2 , f 2 + ( z 1 ) = f 2 ( x 1 z 1 ) + f 2 ( z 1 y 1 ) = ( 6 k + 2 ) + 2 = 6 k + 4 , f 2 + ( v k + 1 ) = f 2 ( v k v k + 1 ) + f 2 ( v k + 1 v k + 2 ) = 6 k + 1 , and f 2 + ( v k + 2 ) = f 2 ( v k + 1 v k + 2 ) + f 2 ( v k + 2 v k + 3 ) (or f 2 ( v k + 2 u k + 3 ) )   = 1 + ( 6 k + 4 ) = 6 k + 5 . It is observed that f 2 + ( y ) are distinct for all y P . To show that f 2 + ( x ) are distinct for all x V ( m P 3 P n ) , it suffices to show that f 2 + ( P ) f 2 + ( Q ) = ϕ . Firstly, we divide Q into two parts, A and B, where A = { y 1 } ( i = 2 2 k { x i , y i , z i } ) ( i = 1 k { u i , v i } ) and B = Q A . We now claim that f 2 + ( P ) f 2 + ( A ) = ϕ . From the proof of Lemma 1, it can be seen that the values f 2 + ( x 2 k 1 ) = 6 k 5 , f 2 + ( y 2 k 1 ) = 6 k 4 , f 2 + ( x 2 k ) = 6 k 2 , and f 2 + ( y 2 k ) = 6 k 1 are the greatest numbers in f 2 + ( A ) congruent to 1, 2, 4, and 5 modulo 6, respectively. As f 2 + ( v k + 1 ) 1 mod 6 and f 2 + ( v k + 1 ) > f 2 + ( x 2 k 1 ) , f 2 + ( x 1 ) 2 mod 6 and f 2 + ( x 1 ) > f 2 + ( y 2 k 1 ) , f 2 + ( z 1 ) 4 mod 6 and f 2 + ( z 1 ) > f 2 + ( x 2 k ) , and f 2 + ( v k + 2 ) 5 mod 6 and f 2 + ( v k + 2 ) > f 2 + ( y 2 k ) , we have f 2 + ( P ) f 2 + ( A ) = ϕ . Next, we claim that f 2 + ( P ) f 2 + ( B ) = ϕ . Evidently, f 2 + ( u k + 1 ) = f 2 ( u k u k + 1 ) + f 2 ( u k + 1 u k + 2 ) = ( 6 k 3 ) + ( 6 k + 1 ) = 12 k 2 is the least number in f 2 + ( B ) , and f 2 + ( v k + 2 ) = 6 k + 5 is the greatest number in f 2 + ( P ) . As f 2 + ( u k + 1 ) > f 2 + ( v k + 2 ) when k 2 , we have f 2 + ( P ) f 2 + ( B ) = ϕ . Thus, f 2 + ( P ) f 2 + ( Q ) = ϕ .
The above two cases show that the linear forest m P 3 P n has an antimagic labeling. Hence, m P 3 P n is antimagic. □
The following lemma shows that the linear forest m P 3 P m + 4 ( m 2 ) also has an antimagic labeling.
Lemma 3.
For m 2 , linear forest m P 3 P m + 4 is antimagic.
Proof. 
Let f be the edge labeling of m P 3 P m + 4 which is defined as in Lemma 1. We distinguish the two cases m = 2 k + 1 and m = 2 k , where k N .
Case 1. m = 2 k + 1 . In this case, P m + 4 is the path u 1 u 2 u k + 2 u k + 3 v k + 2 v k + 1 v 2 v 1 . Now, we define a function f 1 on E ( m P 3 P m + 4 ) as
f 1 ( z 1 y 1 ) = f ( v k + 2 v k + 1 ) = 6 k + 4 , f 1 ( v k + 2 v k + 1 ) = f ( u k + 3 v k + 2 ) = 6 k + 6 , f 1 ( u k + 3 v k + 2 ) = f ( z 1 y 1 ) = 2 , f 1 ( e ) = f ( e ) for   every   other   edge   e .
Evidently, f 1 is an edge labeling of m P 3 P m + 4 , and f 1 + ( x ) = f + ( x ) for all x V ( m P 3 P m + 4 ) { y 1 , z 1 , u k + 3 , v k + 2 , v k + 1 } . Let P = { y 1 , z 1 , u k + 1 , u k + 2 , u k + 3 , v k + 2 , v k + 1 } , and Q = V ( m P 3 P m + 4 ) P . According to Lemma 1, f 1 + ( x ) are distinct for all x Q . Now, we evaluate f 1 + ( y ) for all y P . We see that f 1 + ( y 1 ) = f 1 ( z 1 y 1 ) = 6 k + 4 , f 1 + ( z 1 ) = f 1 ( x 1 z 1 ) + f 1 ( z 1 y 1 ) = 1 + ( 6 k + 4 ) = 6 k + 5 , f 1 + ( u k + 1 ) = f 1 ( u k u k + 1 ) + f 1 ( u k + 1 u k + 2 ) = ( 6 k 3 ) + ( 6 k + 3 ) = 12 k , f 1 + ( u k + 2 ) = f 1 ( u k + 1 u k + 2 ) + f 1 ( u k + 2 u k + 3 ) = ( 6 k + 3 ) + ( 6 k + 5 ) = 12 k + 8 , f 1 + ( u k + 3 ) = f 1 ( u k + 2 u k + 3 ) + f 1 ( u k + 3 v k + 2 ) = ( 6 k + 5 ) + 2 = 6 k + 7 , f 1 + ( v k + 2 ) = f 1 ( u k + 3 v k + 2 ) + f 1 ( v k + 2 v k + 1 ) = 2 + ( 6 k + 6 ) = 6 k + 8 , and f 1 + ( v k + 1 ) = f 1 ( v k + 2 v k + 1 ) + f 1 ( v k + 1 v k ) = ( 6 k + 6 ) + 6 k = 12 k + 6 . It is observed that f 1 + ( y ) are distinct for all y P . To show that f 1 + ( x ) are distinct for all x V ( m P 3 P m + 4 ) , it suffices to show that f 1 + ( P ) f 1 + ( Q ) = ϕ . From the proof of Lemma 1, it can be seen that the values f 1 + ( x 2 k + 1 ) = 6 k + 1 , f 1 + ( y 2 k + 1 ) = 6 k + 2 , f 1 + ( x 2 k ) = 6 k 2 , f 1 + ( y 2 k ) = 6 k 1 , and f 1 + ( v k ) = 12 k 6 are the greatest numbers in f 1 + ( Q ) congruent to 1, 2, 4, 5, and 0 modulo 6, respectively. As f 1 + ( u k + 3 ) 1 mod 6 and f 1 + ( u k + 3 ) > f 1 + ( x 2 k + 1 ) , f 1 + ( u k + 2 ) f 1 + ( v k + 2 ) 2 mod 6 and f 1 + ( u k + 2 ) > f 1 + ( v k + 2 ) > f 1 + ( y 2 k + 1 ) , f 1 + ( y 1 ) 4 mod 6 and f 1 + ( y 1 ) > f 1 + ( x 2 k ) , f 1 + ( z 1 ) 5 mod 6 and f 1 + ( z 1 ) > f 1 + ( y 2 k ) , and f 1 + ( v k + 1 ) f 1 + ( u k + 1 ) 0 mod 6 and f 1 + ( v k + 1 ) > f 1 + ( u k + 1 ) > f 1 + ( v k ) , we have f 1 + ( P ) f 1 + ( Q ) = ϕ .
Case 2. m = 2 k . In this case, P m + 4 is the path u 1 u 2 u k + 1 u k + 2 v k + 2 v k + 1 v 2 v 1 . Now, we define a function f 2 on E ( m P 3 P m + 4 ) as
f 2 ( z 1 y 1 ) = f ( u k + 1 u k + 2 ) = 6 k + 1 , f 2 ( u k + 1 u k + 2 ) = f ( u k + 2 v k + 2 ) = 6 k + 3 , f 2 ( u k + 2 v k + 2 ) = f ( z 1 y 1 ) = 2 , f 2 ( e ) = f ( e ) for   every   other   edge   e .
Evidently, f 2 is an edge labeling of m P 3 P m + 4 , and f 2 + ( x ) = f + ( x ) for all x V ( m P 3 P m + 4 ) { y 1 , z 1 , u k + 1 , u k + 2 , v k + 2 } . It is observed that if k = 1 , f 2 is an antimagic labeling of 2 P 3 P 6 . In the following, we consider the case of k 2 . Let P = { y 1 , z 1 , u k + 1 , u k + 2 , v k + 2 , v k + 1 } , and Q = V ( m P 3 P m + 4 ) P . According to Lemma 1, f 2 + ( x ) are distinct for all x Q . Now, we evaluate f 2 + ( y ) for all y P . We see that f 2 + ( y 1 ) = f 2 ( z 1 y 1 ) = 6 k + 1 , f 2 + ( z 1 ) = f 2 ( x 1 z 1 ) + f 2 ( z 1 y 1 ) = 1 + ( 6 k + 1 ) = 6 k + 2 , f 2 + ( u k + 1 ) = f 2 ( u k u k + 1 ) + f 2 ( u k + 1 u k + 2 ) = ( 6 k 3 ) + ( 6 k + 3 ) = 12 k , f 2 + ( u k + 2 ) = f 2 ( u k + 1 u k + 2 ) + f 2 ( u k + 2 v k + 2 ) = ( 6 k + 3 ) + 2 = 6 k + 5 , f 2 + ( v k + 2 ) = f 2 ( u k + 2 v k + 2 ) + f 2 ( v k + 2 v k + 1 ) = 2 + ( 6 k + 2 ) = 6 k + 4 , and f 2 + ( v k + 1 ) = f 2 ( v k + 2 v k + 1 ) + f 2 ( v k + 1 v k ) = ( 6 k + 2 ) + 6 k = 12 k + 2 . It is observed that f 2 + ( y ) are distinct for all y P . To show that f 2 + ( x ) are distinct for all x V ( m P 3 P m + 4 ) , it suffices to show that f 2 + ( P ) f 2 + ( Q ) = ϕ . From the proof of Lemma 1, it can be seen that the values f 2 + ( x 2 k 1 ) = 6 k 5 , f 2 + ( y 2 k 1 ) = 6 k 4 , f 2 + ( x 2 k ) = 6 k 2 , f 2 + ( y 2 k ) = 6 k 1 , and f 2 + ( v k ) = 12 k 6 are the greatest numbers in f 2 + ( Q ) congruent to 1, 2, 4, 5, and 0 modulo 6, respectively. As f 2 + ( y 1 ) 1 mod 6 and f 2 + ( y 1 ) > f 2 + ( x 2 k 1 ) , f 2 + ( v k + 1 ) f 2 + ( z 1 ) 2 mod 6 and f 2 + ( v k + 1 ) > f 2 + ( z 1 ) > f 2 + ( y 2 k 1 ) , f 2 + ( v k + 2 ) 4 mod 6 and f 2 + ( v k + 2 ) > f 2 + ( x 2 k ) , f 2 + ( u k + 2 ) 5 mod 6 and f 2 + ( u k + 2 ) > f 2 + ( y 2 k ) , and f 2 + ( u k + 1 ) 0 mod 6 and f 2 + ( u k + 1 ) > f 2 + ( v k ) , we have f 2 + ( P ) f 2 + ( Q ) = ϕ .
The above two cases show that the linear forest m P 3 P m + 4 has an antimagic labeling. Thus, m P 3 P m + 4 is antimagic. □
According to Lemmas 2 and 3, we have the following theorem.
Theorem 2.
For m 4 and n m + 4 , linear forest m P 3 P n is antimagic.

3. Conclusions

Theorem 2 states that linear forest m P 3 P n is antimagic for 4 m n 4 and n 8 . According to Theorem 1 for n 4 if m P 3 P n is antimagic then m 2 n 7 + 8 n 2 40 n + 49 2 . It is seen that there is a gap between n 4 and 2 n 7 + 8 n 2 40 n + 49 2 . We would like to know if the upper bound n 4 for m in Theorem 2 can be raised. To conclude this study, the following problems are proposed. The first one is previously mentioned in Section 1.
Problem 1.
How many disjoint paths P 3 can be added to a P 2 , P 3 -free linear forest such that the extended new linear forest is still antimagic?
Problem 2.
What are the necessary and sufficient conditions for linear forest m P 3 P n to be antimagic?

Author Contributions

Conceptualization, J.-L.S. and F.-H.C.; Funding acquisition, J.-L.S.; Methodology, J.-L.S. and F.-H.C.; Writing—original draft, J.-L.S. and F.-H.C.; Writing—review & editing, J.-L.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Ministry of Science and Technology of R.O.C. with grant number MOST 108-2115-M-424-001.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hartsfield, N.; Ringel, G. Pearls in Graph Theory: A Comprehensive Introduction; Academic Press: Boston, MA, USA, 1990. [Google Scholar]
  2. Alon, N.; Kaplan, G.; Lev, A.; Roditty, Y.; Yuster, R. Dense graphs are antimagic. J. Graph Theory 2004, 47, 297–309. [Google Scholar] [CrossRef]
  3. Chang, F.; Liang, Y.-C.; Pan, Z.; Zhu, X. Antimagic labeling of regular graphs. J. Graph Theory 2016, 82, 339–349. [Google Scholar] [CrossRef]
  4. Cheng, Y. Lattice grids and prisms are antimagic. Theor. Comput. Sci. 2007, 374, 66–73. [Google Scholar] [CrossRef]
  5. Cheng, Y. A new class of antimagic Cartesian product graphs. Discret. Math. 2008, 308, 6441–6448. [Google Scholar] [CrossRef]
  6. Cranston, D.W. Regular bipartite graphs are antimagic. J. Graph Theory 2009, 60, 173–182. [Google Scholar] [CrossRef]
  7. Cranston, D.W.; Liang, Y.-C.; Zhu, X. Regular graphs of odd degree are antimagic. J. Graph Theory 2015, 80, 28–33. [Google Scholar] [CrossRef]
  8. Kaplan, G.; Lev, A.; Roditty, Y. On zero-sum partitions and anti-magic trees. Discret. Math. 2009, 309, 2010–2014. [Google Scholar] [CrossRef]
  9. Lee, M.-J.; Lin, C.; Tsai, W.-H. On antimagic labeling for power of cycles. Ars Comb. 2011, 98, 161–165. [Google Scholar]
  10. Liang, Y.-C.; Wong, T.-L.; Zhu, X. Anti-magic labeling of trees. Discret. Math. 2014, 331, 9–14. [Google Scholar] [CrossRef]
  11. Liang, Y.-C.; Zhu, X. Anti-magic labelling of Cartesian product of graphs. Theor. Comput. Sci. 2013, 477, 1–5. [Google Scholar] [CrossRef]
  12. Liang, Y.-C.; Zhu, X. Antimagic labeling of cubic graphs. J. Graph Theory 2014, 75, 31–36. [Google Scholar] [CrossRef]
  13. Wang, T.-M.; Hsiao, C.-C. On anti-magic labeling for graph products. Discret. Math. 2008, 308, 3624–3633. [Google Scholar] [CrossRef]
  14. Zhang, Y.; Sun, X. The antimagicness of the Cartesian product of graphs. Theor. Comput. Sci. 2009, 410, 727–735. [Google Scholar] [CrossRef]
  15. Wang, T.-M.; Liu, M.-J.; Li, D.-M. Some classes of disconnected antimagic graphs and their joins. Wuhan Univ. J. Nat. Sci. 2012, 17, 195–199. [Google Scholar] [CrossRef]
  16. Shang, J.-L.; Lin, C.; Liaw, S.-C. On the antimagic labeling of star forests. Util. Math. 2015, 97, 373–385. [Google Scholar]
  17. Chen, Z.-C.; Huang, K.-C.; Lin, C.; Shang, J.-L.; Lee, M.-J. Antimagicness of star forests. Util. Math. 2020, 114, 283–294. [Google Scholar]
  18. Shang, J.-L. P2, P3, P4-free linear forests are antimagic. Util. Math. 2016, 101, 13–22. [Google Scholar]
  19. Shang, J.-L. Antimagic labeling of linear forests. Util. Math. 2018, 106, 23–37. [Google Scholar]
  20. Dhananjaya, E.; Li, W.-T. Antimagic labeling of forests with sets of consecutive integers. Discret. Appl. Math. 2022, 309, 75–84. [Google Scholar] [CrossRef]
Figure 1. Notations for vertices in m P 3 P n with an odd integer n 5 .
Figure 1. Notations for vertices in m P 3 P n with an odd integer n 5 .
Mathematics 10 02036 g001
Figure 2. Edge labels and vertex sums of 7 P 3 P 11 under edge labeling f.
Figure 2. Edge labels and vertex sums of 7 P 3 P 11 under edge labeling f.
Mathematics 10 02036 g002
Figure 3. Vertices in 2 P 3 P n ( n 6 ) have distinct vertex sums, except for f + ( z 1 ) = f + ( u 1 ) = 3 .
Figure 3. Vertices in 2 P 3 P n ( n 6 ) have distinct vertex sums, except for f + ( z 1 ) = f + ( u 1 ) = 3 .
Mathematics 10 02036 g003
Figure 4. Vertices in 3 P 3 P n ( n 7 ) have distinct vertex sums, except for f + ( z 1 ) = f + ( u 1 ) = 3 .
Figure 4. Vertices in 3 P 3 P n ( n 7 ) have distinct vertex sums, except for f + ( z 1 ) = f + ( u 1 ) = 3 .
Mathematics 10 02036 g004
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Shang, J.-L.; Chang, F.-H. Linear Forest mP3 Plus a Longer Path Pn Becoming Antimagic. Mathematics 2022, 10, 2036. https://0-doi-org.brum.beds.ac.uk/10.3390/math10122036

AMA Style

Shang J-L, Chang F-H. Linear Forest mP3 Plus a Longer Path Pn Becoming Antimagic. Mathematics. 2022; 10(12):2036. https://0-doi-org.brum.beds.ac.uk/10.3390/math10122036

Chicago/Turabian Style

Shang, Jen-Ling, and Fei-Huang Chang. 2022. "Linear Forest mP3 Plus a Longer Path Pn Becoming Antimagic" Mathematics 10, no. 12: 2036. https://0-doi-org.brum.beds.ac.uk/10.3390/math10122036

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop