On Super (𝑎,𝑑)-Edge-Antimagic Total Labeling of Special Types of Crown Graphs

Abstract

For a graph 𝐺=(𝑉,𝐸), a bijection 𝑓 from 𝑉(𝐺)∪𝐸(𝐺)→{1,2,…,|𝑉(𝐺)|+|𝐸(𝐺)|} is called (𝑎,𝑑)-edge-antimagic total ((𝑎,𝑑)-EAT) labeling of 𝐺 if the edge-weights 𝑤(𝑥𝑦)=𝑓(𝑥)+𝑓(𝑦)+𝑓(𝑥𝑦),𝑥𝑦∈𝐸(𝐺), form an arithmetic progression starting from 𝑎 and having a common difference 𝑑, where 𝑎>0 and 𝑑≥0 are two fixed integers. An (𝑎,𝑑)-EAT labeling is called super (𝑎,𝑑)-EAT labeling if the vertices are labeled with the smallest possible numbers; that is, 𝑓(𝑉)={1,2,…,|𝑉(𝐺)|}. In this paper, we study super (𝑎,𝑑)-EAT labeling of cycles with some pendant edges attached to different vertices of the cycle.

1. Introduction

All graphs considered here are finite, undirected, and without loops and multiple edges. Let 𝐺 be a graph with the vertex set 𝑉=𝑉(𝐺) and the edge set 𝐸=𝐸(𝐺). For a general reference of the graph theoretic notions, see [1, 2].

A labeling (or valuation) of a graph is a map that carries graph elements to numbers, usually to positive or nonnegative integers. In this paper, the domain of the map is the set of all vertices and all edges of a graph. Such type of labeling is called total labeling. Some labelings use the vertex-set only, or the edge-set only, and we will call them vertex labelings or edge labelings, respectively. The most complete recent survey of graph labelings can be seen in [3, 4].

A bijection 𝑔∶𝑉(𝐺)→{1,2,…,|𝑉(𝐺)|} is called (𝑎,𝑑)-edge-antimagic vertex ((𝑎,𝑑)-EAV) labeling of 𝐺 if the set of edge-weights of all edges in 𝐺 is equal to the set {𝑎,𝑎+𝑑,𝑎+2𝑑,…,𝑎+(|𝐸(𝐺)|−1)𝑑}, where 𝑎>0 and 𝑑≥0 are two fixed integers. The edge-weight 𝑤_𝑔(𝑥𝑦) of an edge 𝑥𝑦∈𝐸(𝐺) under the vertex labeling 𝑔 is defined as the sum of the labels of its end vertices; that is, 𝑤_𝑔(𝑥𝑦)=𝑔(𝑥)+𝑔(𝑦). A graph that admits (𝑎,𝑑)-EAV labeling is called an (𝑎,𝑑)-EAV graph.

A bijection 𝑓∶𝑉(𝐺)∪𝐸(𝐺)→{1,2,…,|𝑉(𝐺)|+|𝐸(𝐺)|} is called (𝑎,𝑑)-edge-antimagic total ((𝑎,𝑑)-EAT) labeling of 𝐺 if the set of edge-weights of all edges in 𝐺 forms an arithmetic progression starting from 𝑎 with the difference 𝑑, where 𝑎>0 and 𝑑≥0 are two fixed integers. The edge-weight 𝑤_𝑓(𝑥𝑦) of an edge 𝑥𝑦∈𝐸(𝐺) under the total labeling 𝑓 is defined as the sum of the edge label and the labels of its end vertices. This means that{𝑤_𝑓(𝑥𝑦)=𝑓(𝑥)+𝑓(𝑦)+𝑓(𝑥𝑦)∶𝑥𝑦∈𝐸(𝐺)}={𝑎,𝑎+𝑑,𝑎+2𝑑,…,𝑎+(|𝐸(𝐺)|−1)𝑑}. Moreover, if the vertices are labeled with the smallest possible numbers, that is, 𝑓(𝑉)={1,2,…,|𝑉(𝐺)|}, then the labeling is called super (𝑎,𝑑)-edge-antimagic total (super (𝑎,𝑑)-EAT). A graph that admits an (𝑎,𝑑)-EAT labeling or a super (𝑎,𝑑)-EAT labeling is called an (𝑎,𝑑)-EAT graph or a super (𝑎,𝑑)-EAT graph, respectively.

The super (𝑎,0)-EAT labelings are usually called super edge-magic; see [5–8]. Definition of super (𝑎,𝑑)-EAT labeling was introduced by Simanjuntak et al. [9]. This labeling is a natural extension of the notions of edge-magic labeling; see [7, 8]. Many other researchers investigated different types of antimagic graphs. For example, see Bodendiek and Walther [10], Hartsfield and Ringel [11].

In [9], Simanjuntak et al. defined the concept of (𝑎,𝑑)-EAV graphs and studied the properties of (𝑎,𝑑)-EAV labeling and (𝑎,𝑑)-EAT labeling and gave constructions of (𝑎,𝑑)-EAT labelings for cycles and paths. Bača et al. [12] presented some relation between (𝑎,𝑑)-EAT labeling and other labelings, namely, edge-magic vertex labeling and edge-magic total labeling.

In this paper, we study super (𝑎,𝑑)-EAT labeling of the class of graphs that can be obtained from a cycle by attaching some pendant edges to different vertices of the cycle.

2. Basic Properties

Let us first recall the known upper bound for the parameter 𝑑 of super (𝑎,𝑑)-EAT labeling. Assume that a graph 𝐺 has a super (𝑎,𝑑)-EAT labeling 𝑓, 𝑓∶𝑉(𝐺)∪𝐸(𝐺)→{1,2,…,|𝑉(𝐺)|+|𝐸(𝐺)|}. The minimum possible edge-weight in the labeling 𝑓 is at least 1+2+(|𝑉(𝐺)|+1)=|𝑉(𝐺)|+4. Thus, 𝑎≥|𝑉(𝐺)|+4. On the other hand, the maximum possible edge-weight is at most (|𝑉(𝐺)|−1)+|𝑉(𝐺)|+(|𝑉(𝐺)|+|𝐸(𝐺)|)=3|𝑉(𝐺)|+|𝐸(𝐺)|−1. So 𝑎+(|𝐸(𝐺)|−1)𝑑≤3|𝑉(𝐺)|+|𝐸(𝐺)|−1,2|𝑉(𝐺+|𝐸(𝐺𝑑≤)|)|−5|𝐸(𝐺.)|−1 (1)(2)

Thus, we have the upper bound for the difference 𝑑. In particular, from (2), it follows that, for any connected graph, where |𝑉(𝐺)|−1≤|𝐸(𝐺)|, the feasible value 𝑑 is no more than 3.

The next proposition, proved by Bača et al. [12], gives a method on how to extend an edge-antimagic vertex labeling to a super edge-antimagic total labeling.

Proposition 1 (see [12]). If a graph 𝐺 has an (𝑎,𝑑)-EAV labeling, then (i)𝐺has a super (𝑎+|𝑉(𝐺)|+1,𝑑+1)-EAT labeling, and(ii)𝐺 has a super (𝑎+|𝑉(𝐺)|+|𝐸(𝐺)|,𝑑−1)-EAT labeling.

The following lemma will be useful to obtain a super edge-antimagic total labeling.

Lemma 2 (see [13]). Let 𝔄 be a sequence 𝔄={𝑐,𝑐+1,𝑐+2,…,𝑐+𝑘}, 𝑘 even. Then, there exists a permutation Π(𝔄) of the elements of 𝔄, such that 𝔄+Π(𝔄)={2𝑐+𝑘/2,2𝑐+𝑘/2+1,2𝑐+𝑘/2+2,…,2𝑐+3𝑘/2−1,2𝑐+3𝑘/2}.

Using this lemma, we obtain that, if 𝐺 is an (𝑎,1)-EAV graph with odd number of edges, then 𝐺 is also super (𝑎^′,1)-EAT.

3. Crowns

If 𝐺 has order 𝑛, the corona of 𝐺 with 𝐻, denoted by 𝐺⊙𝐻, is the graph obtained by taking one copy of 𝐺 and 𝑛 copies of 𝐻 and joining the 𝑖th vertex of 𝐺 with an edge to every vertex in the 𝑖th copy of 𝐻. A cycle of order 𝑛 with an 𝑚 pendant edges attached at each vertex, that is, 𝐶_𝑛⊙𝑚𝐾₁, is called an 𝑚-crown with cycle of order 𝑛. A 1-crown, or only crown, is a cycle with exactly one pendant edge attached at each vertex of the cycle. For the sake of brevity, we will refer to the crown with cycle of order 𝑛 simply as the crown if its cycle order is clear from the context. Note that a crown is also known in the literature as a sun graph. In this section, we will deal with the graphs related to 1-crown with cycle of order 𝑛.

Silaban and Sugeng [14] showed that, if the 𝑚-crown 𝐶_𝑛⊙𝑚𝐾₁ is (𝑎,𝑑)-EAT, then 𝑑≤5. They also describe (𝑎,𝑑)-EAT, labeling of the 𝑚-crown for 𝑑=2 and 𝑑=4. Note that the (𝑎,2)-EAT labeling of 𝑚-crown presented in [14] is super (𝑎,2)-EAT. Moreover, they proved that, if 𝑚≡1(mod4), 𝑛 and 𝑑 are odd; there is no (𝑎,𝑑)-EAT labeling for 𝐶_𝑛⊙𝑚𝐾₁. They also proposed the following open problem.

Open Problem 1 (see [14]). Find if there is an (𝑎,𝑑)-EAT labeling, 𝑑∈{1,3,5} for 𝑚-crown graphs 𝐶_𝑛⊙𝑚𝐾₁.

Figueroa-Centeno et al. [15] proved that the 𝑚-crown graph has a super (𝑎,0)-EAT labeling.

Proposition 3 (see [15]). For every two integers 𝑛≥3 and 𝑚≥1, the 𝑚-crown 𝐶_𝑛⊙𝑚𝐾₁ is super (𝑎,0)-EAT.

According to inequality (2), we have that, if the crown 𝐶_𝑛⊙𝐾₁ is super (𝑎,𝑑)-EAT, then 𝑑≤2. Immediately from Proposition 3 and the results proved in [14], we have that the crown 𝐶_𝑛⊙𝐾₁ is super (𝑎,0)-EAT and super (𝑎,2)-EAT for every positive integer 𝑛≥3. Moreover, for 𝑛 odd, the crown is not (𝑎,1)-EAT. In the following theorem, we prove that the crown is super (𝑎,1)-EAT for 𝑛 even. Thus, we partially give an answer to Open Problem 1.

Theorem 4. For every even positive integer 𝑛, 𝑛≥4, the crown 𝐶_𝑛⊙𝐾₁ is super (𝑎,1)-EAT.

Proof. Let 𝑉(𝐶_𝑛⊙𝐾₁)={𝑣₁,𝑣₂,…,𝑣_𝑛,𝑢₁,𝑢₂,…,𝑢_𝑛} be the vertex set and 𝐸(𝐶_𝑛⊙𝐾₁)={𝑣₁𝑣₂,𝑣₂𝑣₃…,𝑣_𝑛𝑣₁,𝑣₁𝑢₁,𝑣₂𝑢₂,…,𝑣_𝑛𝑢_𝑛} be the edge set of 𝐶_𝑛⊙𝐾₁; see Figure 1.
We define a labeling 𝑓, 𝑓∶𝑉(𝐶_𝑛⊙𝐾₁)∪𝐸(𝐶_𝑛⊙𝐾₁)→{1,2,…,4𝑛} as follows: 𝑓𝑣_𝑖=𝑖+𝑛,for𝑛𝑖=1,2,…,2;𝑖,for𝑛𝑖=2𝑛+1,2𝑓𝑢+2,…,𝑛;_𝑖=𝑖,for𝑛𝑖=1,2,…,2;𝑖+𝑛,for𝑛𝑖=2𝑛+1,2𝑓𝑣+2,…,𝑛;_𝑖𝑣_𝑖+1=7𝑛2+1−𝑖,for𝑛𝑖=1,2,…,2;9𝑛2+1−𝑖,for𝑛𝑖=2𝑛+1,2𝑓𝑣+2,…,𝑛−1;₁𝑣_𝑛=7𝑛2𝑓𝑣+1;_𝑖𝑢_𝑖=3𝑛+1−𝑖,for𝑖=1,2,…,𝑛. (3)
It is easy to check that 𝑓 is a bijection. For the edge-weights under the labeling 𝑓, we have 𝑤_𝑓𝑣₁𝑣_𝑛=11𝑛2𝑤+2;_𝑓𝑣_𝑖𝑣_𝑖+1=11𝑛2+2+𝑖,for𝑛𝑖=1,2,…,2−1;9𝑛2+2+𝑖,for𝑛𝑖=2,𝑛2𝑤+1,…,𝑛−1;_𝑓𝑣_𝑖𝑢_𝑖=4𝑛+1+𝑖,for𝑖=1,2,…,𝑛. (4) Thus, the edge-weights are distinct number from the set {4𝑛+2,4𝑛+3,…,6𝑛+1}. This means that 𝑓 is a super (𝑎,1)-EAT labeling of the crown 𝐶_𝑛⊙𝐾₁.

Figure 1 

The crown 𝐶𝑛⊙𝐾1.

In [16], was proved the following.

Proposition 5 (see [16]). Let 𝐺 be a super (𝑎,1)-EAT graph. Then, the disjoint union of arbitrary number of copies of 𝐺, that is, 𝑠𝐺, 𝑠≥1, also admits a super (𝑎^′,1)-EAT labeling.

In [17], Figueroa-Centeno et al. proved the following.

Proposition 6 (see [17]). If 𝐺 is a (super) (𝑎,0)-EAT bipartite or tripartite graph and 𝑠 is odd, then 𝑠𝐺 is (super) (𝑎^′,0)-EAT.

For (super) (𝑎,2)-EAT labeling for disjoint union of copies of a graph, was shown the following.

Proposition 7 (see [18]). If 𝐺 is a (super) (𝑎,2)-EAT bipartite or tripartite graph and 𝑠 is odd, then 𝑠𝐺 is (super) (𝑎^′,2)-EAT.

Using the above mentioned results, we immediately obtain the following theorem.

Theorem 8. Let 𝑛 be an even positive integer, 𝑛≥4. Then, the disjoint union of arbitrary number of copies of the crown 𝐶_𝑛⊙𝐾₁, that is, 𝑠(𝐶_𝑛⊙𝐾₁), 𝑠≥1, admits a super (𝑎,1)-EAT labeling.

Since the crown 𝐶_𝑛⊙𝐾₁ is either a bipartite graph, for 𝑛 even, or a tripartite graph, for 𝑛 odd, thus, we have the following.

Theorem 9. Let 𝑛 be a positive integer, 𝑛≥3. Then, the disjoint union of odd number of copies of the crown 𝐶_𝑛⊙𝐾₁, that is, 𝑠(𝐶_𝑛⊙𝐾₁), 𝑠≥1, admits a super (𝑎,𝑑)-EAT labeling for 𝑑∈{0,2}.

According to these results we are able to give partially positive answers to the open problems listed in [19].

Open Problem 2 (see [19]). For the graph 𝑠(𝐶_𝑛⊙𝑚𝐾₁), 𝑠𝑛 even, and 𝑚≥1, determine if there is a super (𝑎,𝑑)-EAT labeling with 𝑑∈{0,2}.

Open Problem 3 (see [19]). For the graph 𝑠(𝐶_𝑛⊙𝑚𝐾₁), 𝑠 odd, and 𝑛(𝑚+1) even, determine if there is a super (𝑎,1)-EAT labeling.

4. Graphs Related to Crown Graphs

Let us consider the graph obtained from a crown graph 𝐶_𝑛⊙𝐾₁ by deleting one pendant edge.

Theorem 10. For 𝑛 odd, 𝑛≥3, the graph obtained from a crown graph 𝐶_𝑛⊙𝐾₁ by removing a pendant edge is super (𝑎,𝑑)-EAT for 𝑑∈{0,1,2}.

Proof. Let 𝐺 be a graph obtained from a crown graph 𝐶_𝑛⊙𝐾₁ by removing a pendant edge. Without loss of generality, we can assume that the removed edge is 𝑣₁𝑢₁. Other edges and vertices we denote in the same manner as that of Theorem 4. Thus |𝑉(𝐺)|=2𝑛−1 and |𝐸(𝐺)|=2𝑛−1. It follows from (2) that 𝑑≤2.
Define a vertex labeling 𝑔 as follows: 𝑔𝑣_𝑖=𝑖,for𝑖=1,3,…,𝑛;𝑖+𝑛−1,for𝑔𝑢𝑖=2,4,…,𝑛−1;_𝑖=𝑖+𝑛−1,for𝑖=3,5,…,𝑛;𝑖,for𝑖=2,4,…,𝑛−1. (5) It is easy to see that labeling 𝑔 is a bijection from the vertex set to the set {1,2,…,2𝑛−1}. For the edge-weights under the labeling 𝑔, we have 𝑤_𝑔𝑣₁𝑣_𝑛𝑤=1+𝑛;_𝑔𝑣_𝑖𝑣_𝑖+1=2𝑖+𝑛,for𝑤𝑖=1,2,…,𝑛−1;_𝑔𝑣_𝑖𝑢_𝑖=2𝑖+𝑛−1,for𝑖=2,3,…,𝑛. (6) Thus, the edge-weights are consecutive numbers 𝑛+1,𝑛+2,…,3𝑛−1. This means that 𝑔 is the (𝑎,1)-EAV labeling of 𝐺. According to Proposition 1, the labeling 𝑔 can be extended to the super (𝑎₀,0)-EAT and the super (𝑎₂,2)-EAT labeling of 𝐺. Moreover, as the size of 𝐺 is odd, |𝐸(𝐺)|=2𝑛−1, and according to Lemma 2, we have that 𝐺 is also super (𝑎₁,1)-EAT.

Note that we found some (𝑎,1)-EAV labelings for the graphs obtained from a crown graph 𝐶_𝑛⊙𝐾₁ by removing a pendant edge only for small size of 𝑛, where 𝑛 is even. In Figure 2, there are depicted (𝑎,1)-EAV labelings of these graphs for 𝑛=4,6,8. However, we propose the following conjecture.

Figure 2 

The (𝑎,1)-EAV labelings for the graphs obtained from a crown graph 𝐶𝑛⊙𝐾1 by removing one pendant edge for 𝑛=4,6,8. The edge-weights under the corresponding labelings are depicted in italic.

Conjecture 11. The graph obtained from a crown graph 𝐶_𝑛⊙𝐾₁, 𝑛≥3, by removing a pendant edge is super (𝑎,𝑑)-EAT for 𝑑∈{0,1,2}.

Now, we will deal with the graph obtained from a crown graph 𝐶_𝑛⊙𝐾₁ by removing two pendant edges at distance 1 and at distance 2.

First, consider the case when we remove two pendant edges at distance 1. Let us consider the graph 𝐺 with the (𝑎,1)-EAV labeling 𝑔 defined in the proof of Theorem 10. It is easy to see that the vertex 𝑢_𝑛 is labeled with the maximal vertex label, 𝑔(𝑢_𝑛)=2𝑛−1. Also, the edge-weight of the edge 𝑣_𝑛𝑢_𝑛 is the maximal possible, 𝑤_𝑔(𝑣_𝑛𝑢_𝑛)=𝑔(𝑣_𝑛)+𝑔(𝑢_𝑛)=(2𝑛−1)+𝑛=3𝑛−1. Thus, it is possible to remove the edge 𝑣_𝑛𝑢_𝑛 from the graph 𝐺; we denote the graph by 𝐺_𝑟, and for the labeling 𝑔 restricted to the graph 𝐺_𝑟, we denote it by 𝑔_𝑟. Clearly, 𝑟_𝑟 is (𝑎,1)-EAV labeling of 𝐺_𝑟. According to Proposition 1 from the labeling 𝑔_𝑟, we obtain the super (𝑎₀,0)-EAT and the super (𝑎₂,2)-EAT labeling of 𝐺_𝑟. Note that, as the size of 𝐺_𝑟 is even, |𝐸(𝐺_𝑟)|=2𝑛−2, the labeling 𝑔_𝑟 can not be extended to a super (𝑎₁,1)-EAT labeling of 𝐺_𝑟.

Theorem 12. For odd 𝑛, 𝑛≥3, the graph obtained from a crown graph 𝐶_𝑛⊙𝐾₁ by removing two pendant edges at distance 1 is super (𝑎,𝑑)-EAT for 𝑑∈{0,2}.

Next, we show that, if we remove from a crown graph 𝐶_𝑛⊙𝐾₁, 𝑛≥5, two pendant edges at distance 2, the resulting graph is super (𝑎,𝑑)-EAT for 𝑑∈{0,2}.

Theorem 13. For odd 𝑛, 𝑛≥5, the graph obtained from a crown graph 𝐶_𝑛⊙𝐾₁ by removing two pendant edges at distance 2 is super (𝑎,𝑑)-EAT for 𝑑∈{0,2}.

Proof. Let 𝐺 be a graph obtained from a crown graph 𝐶_𝑛⊙𝐾₁ by removing two pendant edges at distance 2. Let 𝑉(𝐺)={𝑣₁,𝑣₂,…, 𝑣_𝑛,𝑢₂,𝑢₃,…,𝑢_𝑛−2,𝑢_𝑛} be the vertex set and 𝐸(𝐺)={𝑣₁𝑣₂,𝑣₂𝑣₃…, 𝑣_𝑛𝑣₁,𝑣₂𝑢₂,𝑣₃𝑢₃,…,𝑣_𝑛−2𝑢_𝑛−2,𝑣_𝑛𝑢_𝑛} be the edge set of 𝐺. Thus, |𝑉(𝐺)|=2𝑛−2 and |𝐸(𝐺)|=2𝑛−2. Using (2) gives 𝑑≤2.
Define a vertex labeling 𝑔 in the following way: 𝑔𝑣_𝑖=𝑖+12,for𝑖=1,3,…,𝑛;𝑛+𝑖+12,for𝑔𝑢𝑖=2,4,…,𝑛−1;_𝑖=3𝑛−4+𝑖2,for𝑖=3,5,…,𝑛;2𝑛+𝑖2,for𝑖=2,4,…,𝑛−3. (7) It is not difficult to check that the labeling 𝑔 is a bijection from the vertex set of 𝐺 to the set {1,2,…,2𝑛−2} and that the edge-weights under the labeling 𝑔 are consecutive numbers (𝑛+3)/2,(𝑛+5)/2,…,(5𝑛−3)/2. Thus 𝑔 is the (𝑎,1)-EAV labeling of 𝐺. According to Proposition 1, it is possible to extend the labeling 𝑔 to the super (𝑎₀,0)-EAT and the super (𝑎₂,2)-EAT labelings of 𝐺.

Result in the following theorem is based on the Petersen Theorem.

Proposition 14 (Petersen Theorem). Let 𝐺 be a 2𝑟-regular graph. Then, there exists a 2-factor in 𝐺.

Notice that, after removing edges of the 2-factor guaranteed by the Petersen Theorem, we have again an even regular graph. Thus, by induction, an even regular graph has a 2-factorization.

The construction in the following theorem allows to find a super (𝑎,1)-EAT labeling of any graph that arose from an even regular graph by adding even number of pendant edges to different vertices of the original graph. Notice that the construction does not require the graph to be connected.

Theorem 15. Let 𝐺 be a graph that arose from a 2𝑟-regular graph 𝐻, 𝑟≥0, by adding 𝑘 pendant edges to 𝑘 different vertices of 𝐻, 0≤𝑘≤|𝑉(𝐻)|. If 𝑘 is an even integer, then the graph 𝐺 is super (𝑎,1)-EAT.

Proof. Let 𝐺 be a graph that arose from a 2𝑟-regular graph 𝐻, 𝑟≥0, by adding 𝑘 pendant edges to 𝑘 different vertices of 𝐻, 0≤𝑘≤|𝑉(𝐻)| and let 𝑚=|𝑉(𝐻)|−𝑘. Thus, |𝑉(𝐺)|=2𝑘+𝑚, |𝐸(𝐺)|=𝑘+𝑟(𝑘+𝑚), and |𝐸(𝐻)|=𝑟(𝑘+𝑚).
Let 𝑘 be an even integer. Let us denote the pendant edges of 𝐺 by symbols 𝑒₁,𝑒₂,…,𝑒_𝑘. We denote the vertices of 𝐺 such that 𝑒_𝑖=𝑣_𝑖𝑣_{𝑘+𝑚+𝑖},𝑖=1,2,…,𝑘, (8) and moreover 𝑣_𝑘/2+1,𝑣_𝑘/2+2,…,𝑣_𝑘,𝑣_𝑘+𝑚+1,𝑣_𝑘+𝑚+2,…,𝑣_3𝑘/2+𝑚⊂𝑉(𝐻). (9) We denote the remaining 𝑚 vertices of 𝑉(𝐻) arbitrarily by the symbols 𝑣_𝑘+1,𝑣_𝑘+2,…,𝑣_𝑘+𝑚.
By the Petersen Theorem, there exists a 2-factorization of 𝐻. We denote the 2-factors by 𝐹_𝑗, 𝑗=1,2,…,𝑟. Without loss of generality, we can suppose that 𝑉(𝐻)=𝑉(𝐹_𝑗) for all 𝑗, 𝑗=1,2,…,𝑟 and 𝐸(𝐺)=∪^𝑟_𝑗=1𝐸(𝐹_𝑗)∪{𝑒₁,𝑒₂,…,𝑒_𝑘}. Each factor 𝐹_𝑗 is a collection of cycles. We order and orient the cycles arbitrarily such that the arcs form oriented cycles. Now, we denote by the symbol 𝑒^out_𝑗(𝑣_𝑡) the unique outgoing arc that forms the vertex 𝑣_𝑡 in the factor 𝐹_𝑗, 𝑡=𝑘/2+1,𝑘/2+2,…,3𝑘/2+𝑚. Note that each edge is denoted by two symbols.
We define a total labeling 𝑓 of 𝐺 in the following way: 𝑓𝑣_𝑖=𝑖,for𝑓𝑒𝑖=1,2,…,2𝑘+𝑚;_𝑖=3𝑘+𝑚+1−𝑖,for𝑓𝑒𝑖=1,2,…,𝑘;_out𝑗𝑣_𝑡=7𝑘2+𝑚+1−𝑓𝑣_𝑡+𝑗(𝑘+𝑚),for𝑘𝑡=2𝑘+1,2+2,…,3𝑘2+𝑚,𝑗=1,2,…,𝑟. (10)
It is easy to see that the vertices are labeled by the first 2𝑘+𝑚 integers, the edges 𝑒₁,𝑒₂,…,𝑒_𝑘 by the next 𝑘 labels, and the edges of 𝐻 by consecutive integers starting at 3𝑘+𝑚+1. Thus, 𝑓 is a bijection 𝑉(𝐺)∪𝐸(𝐺)→{1,2,…3𝑘+𝑚+𝑟(𝑘+𝑚)}.
It is not difficult to verify that 𝑓 is a super (4𝑘+2𝑚+2,1)-EAT labeling of 𝐺. For the weights of the edges 𝑒_𝑖, 𝑖=1,2,…,𝑘, we have 𝑤_𝑓𝑒_𝑖=𝑓𝑣_𝑖+𝑓𝑣_𝑘+𝑚+1+𝑓𝑒_𝑖=𝑖+(𝑘+𝑚+𝑖)+(3𝑘+𝑚+1−𝑖)=4𝑘+2𝑚+1+𝑖. (11) Thus, the edge-weights are the numbers 4𝑘+2𝑚+2,4𝑘+2𝑚+3,…,5𝑘+2𝑚+1. (12) For convenience, we denote by 𝑣_𝑠 the unique vertex such that 𝑣_𝑡𝑣_𝑠=𝑒^out_𝑗(𝑣_𝑡) in 𝐹_𝑗, where 𝑠∈{𝑘/2+1,𝑘/2+2,…,3𝑘/2+𝑚}. The weights of the edges in 𝐹_𝑗, 𝑗=1,2,…,𝑟, are 𝑤_𝑓𝑒^out_𝑗𝑣_𝑡=𝑓𝑣_𝑡+𝑓𝑣_𝑠+𝑓𝑒^out_𝑗𝑣_𝑡=𝑓𝑣_𝑡+𝑓𝑣_𝑠+7𝑘2+𝑚+1−𝑓𝑣_𝑡()=+𝑗𝑘+𝑚7𝑘2+𝑚+1+𝑗(𝑘+𝑚)+𝑓𝑣_𝑠 (13) for all 𝑡=(𝑘/2)+1,(𝑘/2)+2,…,(3𝑘/2)+𝑚, and 𝑗=1,2,…,𝑟. Since 𝐹_𝑗 is a factor in 𝐻 it holds {𝑓(𝑣_𝑠)∶𝑣_𝑠∈𝐹_𝑗}={𝑘/2+1,𝑘/2+2,…,3𝑘/2+𝑚}. Hence, we have that the set of the edge-weights in the factor 𝐹_𝑗 is ()()(,4𝑘+𝑚+2+𝑗𝑘+𝑚,4𝑘+𝑚+3+𝑗𝑘+𝑚,…,5𝑘+2𝑚+1+𝑗𝑘+𝑚) (14) and thus, the set of all edge-weights in 𝐺 under the labeling 𝑓 is {4𝑘+2𝑚+2,4𝑘+2𝑚+3,…,5𝑘+2𝑚+1+𝑟(𝑘+𝑚)}. (15)

We conclude the paper with the result that immediately follows from the previous theorem.

Corollary 16. Let 𝐺 be a graph obtained from a crown graph 𝐶_𝑛⊙𝐾₁, 𝑛≥3, by deleting any 𝑘 pendant edges, 0≤𝑘≤𝑛. If 𝑛−𝑘 is even, then 𝐺 is a super (𝑎,1)-EAT graph.

Acknowledgments

This research is partially supported by FAST-National University of Computer and Emerging Sciences, Peshawar, and Higher Education Commission of Pakistan. The research for this paper was also supported by Slovak VEGA Grant 1/0130/12.