Full Edge-Friendly Index Sets of One Point Union of Cycles

Gao, Zhen-Bin; Shiu, Wai Chee; Lee, Sin-Min; Lau, Gee-Choon

doi:10.61091/ars159-03

Abstract

References

Ars Combinatoria

Volume 159
Pages: 21-30

Research article

Full Edge-Friendly Index Sets of One Point Union of Cycles

^¹, ^², ^³, ^⁴

¹College of General Education, Guangdong University of Science and Technology, Dongguan, 523000, P.R. China

²Department of Mathematics, The Chinese University of Hong Kong, Shatin, Hong Kong, P.R. China.

³1786, Plan Tree Drive, Upland, CA 91784, USA

⁴College of Computing, Informatics & Mathematics, Universiti Teknologi MARA (Segamat Campus), 85000 Malaysia

Received: 15/03/2019
Accepted: 28/05/2019
Published: 30/06/2024

Copyright Link
License

Abstract

Let $G = (V, E)$ be a graph with vertex set $V$ and edge set $E$ . An edge labeling $f : E \to Z_{2}$ induces a vertex labeling $f^{+} : V \to Z_{2}$ defined by $f^{+} (v) \equiv \sum_{u v \in E} f (u v) (\mod 2)$ , for each vertex $v \in V$ . For $i \in Z_{2}$ , let $v_{f} (i) = | {v \in V : f^{+} (v) = i} |$ and $e_{f} (i) = | {e \in E : f (e) = i} |$ . An edge labeling $f$ of a graph $G$ is said to be edge-friendly if $| e_{f} (1) - e_{f} (0) | \leq 1$ . The set ${v_{f} (1) - v_{f} (0) : f is an edge-friendly labeling of G}$ is called the full edge-friendly index set of $G$ . In this paper, we shall determine the full edge-friendly index sets of one point union of cycles.

Keywords: One point union of cycles, Edge labeling vector, Vertex labeling vector, Edge-friendly labeling, Full edge-friendly index set

1. Introduction

In this paper, all graphs are simple and connected. We refer to [1] for terms and notation that are not defined in this paper.

Since graph labelings was first introduced by Rosa, various labeling concepts have been introduced [2]. For example, cordial labeling, edge-friendly labeling, harmonious labeling, felicitous labeling, odd harmonious labeling and even harmonious labeling, semi-magic labeling, etc. Most graph labeling methods can be traced to the method introduced by Rosa [3] in 1967, or Graham and Sloane [4] in 1980.

Let $G = (V, E)$ be a graph with vertex set $V$ (or $V (G)$ ) and edge set $E$ (or $E (G)$ ). A labeling $f : E \to Z_{2}$ induces a vertex labeling $f^{+} : V \to Z_{2}$ defined by $f^{+} (v) \equiv \sum_{u v \in E} f (u v) (\mod 2)$ , for each vertex $v \in V$ . Here $Z_{2}$ is the field of order 2.

For $i \in Z_{2}$ , let $v_{f} (i) = | {v \in V$ : $f^{+} (v) = i} |$ and $e_{f} (i) = | {e \in E$ : $f (e) = i} |$ . The number $v_{f} (1) - v_{f} (0)$ is denoted by $I_{f} (G)$ and is called the edge-friendly index of $f$ .

An edge labeled by $i$ is called an $i$ -edge (under $f$ ). A vertex labeled by $i$ is called an $i$ -vertex (under $f$ ). In this paper, an edge labeling (or a $(0, 1)$ -edge labeling) means an edge labeling whose codomain is $Z_{2}$ . An edge labeling $f$ of a graph $G$ is said to be edge-friendly if $| e_{f} (1) - e_{f} (0) | \leq 1$ .

Definition 1. The full edge-friendly index set of $G$ , denoted by FEFI $(G)$ , is the set { $I_{f} (G)$ :f is an edge-friendly labeling of G}.

The concept of full edge-friendly index set was introduced in [5]. Since $v_{f} (1) + v_{f} (0) = | V |$ , $\begin{matrix} (1) & I_{f} (G) = 2 v_{f} (1) - | V | = | V | - 2 v_{f} (0) . \end{matrix}$ So the edge-friendly index of $f$ of $G$ is determined by the value of $v_{f} (1)$ .

Definition 2. Let $f$ be an edge labeling of a graph $G$ of order $p$ and size $q$ . We fix the sequence of vertices $V = {v_{1}, v_{2}, \dots, v_{p}}$ and the sequence of edges $E = {e_{1}, e_{2}, \dots, e_{q}}$ of $G$ . The vector $f (E) = (f (e_{1}), f (e_{2}), \dots, f (e_{q})) \in Z_{2}^{q}$ is called an edge labeling vector of $f$ , where $Z_{2}^{n}$ denotes the Cartesian product of $n$ copies of $Z_{2}$ . Similarly, $f^{+} (V) = (f^{+} (v_{1}), f^{+} (v_{2}), \dots, f^{+} (v_{p})) \in Z_{2}^{p}$ is called a vertex labeling vector of $f$ .

For any (row) vector $X \in Z_{2}^{n}$ , $X^{T}$ denotes the transpose of $X$ .

Let $M$ be the incidence matrix of a graph $G$ according to fixed sequences of vertices and edges. Let $f$ be an edge-labeling of $G = (V, E)$ . It is easy to see that $f^{+} (V)^{T} = M f (E)^{T},$ which is a column vector of length $p$ over $Z_{2}$ .

For a vector $X \in Z_{2}^{p}$ , the number of $1$ ’s in $X$ is denoted by $w t (X)$ , the Hamming weight of $X$ . Hence, if $f$ is an edge-friendly labeling of a graph $G$ , then $w t (f^{+} (V))$ is $v_{f} (1)$ . For convenience, we will identify $f$ with $f (E)^{T}$ . Hence $v_{f} (1) = w t (f^{+} (V)) = w t ((M f)^{T})$ .

Let $H_{i}$ be a graph and $v_{i} \in V (H_{i})$ be fixed, $1 \leq i \leq t$ . A one point union of $H_{i}$ , $1 \leq i \leq t$ , is the graph obtained from the disjoint union of $H_{i}$ by merging all $v_{i}$ into a single vertex which is called the merged vertex or core vertex. So there will be many different one point unions of $H_{i}$ ’s.

If $H_{i} = C_{n_{i}}$ is a cycle of order $n_{i} \geq 3$ , then all one point unions of $H_{i}$ , $1 \leq i \leq t$ , are isomorphic. So we denote the one point union of $C_{n_{i}}$ , $1 \leq i \leq t$ , by $⨄_{k = 1}^{t} C_{n_{k}}$ for $t \geq 2$ . In this paper, we shall study the full edge-friendly index set of the graph $⨄_{k = 1}^{t} C_{n_{k}}$ .

For $1 \leq k \leq t$ , let $C_{n_{k}} = v_{k, 1} v_{k, 2} \dots v_{k, n_{k} - 1} v_{k, n_{k}} v_{k, 1}$ . Let $e_{k, j} = v_{k, j} v_{k, j + 1}$ for $1 \leq j \leq n_{k}$ , where $v_{k, n_{k} + 1} = v_{k, 1}$ . Let $v_{k, 1} \in V (C_{n_{k}})$ be the chosen vertex to be merged. We denote the core vertex of the graph $G_{t} = ⨄_{k = 1}^{t} C_{n_{k}}$ by $c$ (or $v_{0, 0}$ ). Note that $G_{t}$ is of order $(\sum_{k = 1}^{t} n_{k}) - t + 1$ and of size $\sum_{k = 1}^{t} n_{k}$ . Following is the one point union of $C_{3}$ , $C_{4}$ and $C_{6}$ , i.e., $C_{3} ⊎ C_{4} ⊎ C_{6}$ .

In the rest of the paper, we will use the notation defined above.

2. Some Extrema of Edge-Friendly Indices

In this section, necessary and sufficient conditions that give the extrema values of $v_{f} (0)$ or $v_{f} (1)$ are obtained. Following is Lemma 2.1 of [5,6].

Lemma 1. Let $f$ be any edge labeling of a graph $G = (V, E)$ , then $v_{f} (1)$ must be even.

Suppose there are $s$ odd numbers among $n_{1}, \dots, n_{t}$ , where $0 \leq s \leq t$ . Without loss of generality, we may assume that $n_{1}, \dots, n_{s}$ are odd and the others are even. Note that, $s = 0$ means that there is no odd number; $s = t$ means that there is no even number. Now $\begin{matrix} (2) & v_{f} (1) + v_{f} (0) = | V (G_{t}) | = \sum_{k = 1}^{s} n_{k} + \sum_{k = s + 1}^{t} n_{k} - t + 1 \equiv s - t + 1 (\mod 2) . \end{matrix}$ It is obvious that $| V (G_{t}) | \geq v_{f} (0) \geq 0$ for any edge labeling $f$ of $G_{t}$ . By Lemma 1 and the equation above, we have $\begin{matrix} (3) & v_{f} (0) \equiv s - t + 1 (\mod 2) . \end{matrix}$ Hence $v_{f} (0) \geq 1$ if $t - s$ is even for any edge labeling $f$ of $G_{t}$ . A natural question is that whether there is an edge-friendly labeling of $G_{t}$ attaining the lower bound and whether there is an edge-friendly labeling of $G_{t}$ attaining the upper bound.

Lemma 2. Suppose there are $s$ odd numbers among $n_{1}, \dots, n_{t}$ . There is an edge-friendly labeling $f$ of $G_{t}$ such that

$v_{f} (0) = 1$ if and only if $t - s$ is even;
$v_{f} (0) = 0$ if and only if $t - s$ is odd.

Proof. The necessity of (1) and (2) come from Eq. (3).

Note that $G_{t}$ is Eulerian. Let $R$ be an Euler tour of $G_{t}$ . We label the edge of $G_{t}$ by 0 and 1 alternatively along $R$ . Clearly the induced label of each vertex except the core is 1 and the label of the core $c$ is $(t - s) \mod 2$ . Hence we have the sufficiency of (1) and (2). 0

Obtaining the maximum value of $v_{f} (0)$ is equivalent to obtaining the minimum value of $v_{f} (1)$ .

Remark 1. If there are $r$ numbers among $n_{1}, \dots, n_{t}$ such that the sum of these numbers is $⌊ | E (G_{t}) | / 2 ⌋$ , then the sum of the remaining numbers is $⌈ | E (G_{t}) | / 2 ⌉$ . So, the statement ‘there are $r$ numbers among $n_{1}, \dots, n_{t}$ such that the sum of these numbers is $⌊ | E (G_{t}) | / 2 ⌋$ ’ is equivalent to the statement ‘there are $r$ numbers among $n_{1}, \dots, n_{t}$ such that the sum of these numbers is $⌈ | E (G_{t}) | / 2 ⌉$ ’.

Lemma 3. There is an edge-friendly labeling $f$ of $G_{t}$ such that $v_{f} (1) = 0$ if and only if there are $r$ numbers among $n_{1}, \dots, n_{t}$ such that the sum of these numbers is $⌊ | E (G_{t}) | / 2 ⌋$ .

Necessity. Consider the subgraph $E_{i}$ induced by all $i$ -edges of $G_{t}$ under $f$ , $i = 0, 1$ . Since there is no 1-vertex, each cycle of $G_{t}$ is entirely edge-labelled by 1’s or entirely edge-labelled by 0’s. Hence $E_{1}$ is a one point union of some subcycles of $G_{t}$ . Hence $E_{0}$ is also a one point union of some subcycles of $G_{t}$ , namely $E_{0}$ is the one point union of $r$ subcycles. Since $f$ is edge-friendly, $| E (E_{0}) | = ⌊ | E (G_{t}) | / 2 ⌋$ or $⌈ | E (G_{t}) | / 2 ⌉$ . Thus we have the necessary condition by Remark 1.

[Sufficiency] Suppose there are $r$ numbers among $n_{1}, \dots, n_{t}$ such that the sum of such numbers is $⌊ | E (G_{t}) | / 2 ⌋$ . We label the edges of the corresponding cycles by 0 and label the other edges of $G_{t}$ by 1. Thus this labeling is an edge-friendly labeling and the labels of all vertices are 0’s.

3. Full Edge-Friendly Index Sets

The main results are given in this section. For a given one point union of cycles $G_{t} = ⨄_{i = 1}^{t} C_{n_{i}}$ , we fix the sequences of vertices and edges with respect to the lexicographic order. Thus the incident matrix of $G_{t}$ is $M = (\begin{matrix} Z_{1} & Z_{2} & \dots & Z_{t - 1} & Z_{t} \\ B_{1} & O & \dots & \dots & O \\ O & B_{2} & ⋱ & ⋮ & O \\ ⋮ & ⋮ & ⋱ & ⋱ & ⋮ \\ O & O & \dots & B_{t - 1} & O \\ O & O & \dots & O & B_{t} \end{matrix}),$ where $B_{k} = {(\begin{matrix} 1 & 1 & 0 & \dots & 0 & 0 & 0 \\ 0 & 1 & 1 & \dots & 0 & 0 & 0 \\ 0 & 0 & 1 & ⋱ & 0 & 0 & 0 \\ ⋮ & ⋮ & ⋱ & ⋱ & ⋱ & ⋮ & ⋮ \\ 0 & 0 & 0 & \dots & 1 & 1 & 0 \\ 0 & 0 & 0 & \dots & 0 & 1 & 1 \end{matrix})}_{(n_{k} - 1) \times n_{k}}$ , $Z_{k} = {(\begin{matrix} 1 & 0 & \dots & 0 & 1 \end{matrix})}_{1 \times n_{k}}$ , and each $O$ is a zero matrix of certain size, $1 \leq k \leq t$ .

We define some notation and recall some known results first. For positive $l$ , let $1_{l}$ be the row vector of length $l$ whose entries are 1’s, and $0_{l}$ be the row vector of length $l$ whose entries are 0’s. Let $α_{2 l} = (1, 0, 1, 0, \dots, 1, 0) \in Z_{2}^{2 l}$ and $β_{2 l} = (0, 1, 0, 1 \dots, 0, 1) \in Z_{2}^{2 l}$ . For convenience, we let $1_{0}$ , $0_{0}$ , $α_{0}$ and $β_{0}$ be the empty rows.

Let $p = | V (G_{t}) | = (\sum_{k = 1}^{t} n_{k}) - t + 1$ . From (2), we have $p \equiv s - t + 1 (\mod 2)$ , where $s$ is defined in Section 2. So $t - s$ is odd if and only if $p$ is even. From now on, we shall use $q = \sum_{k = 1}^{t} n_{k} = | E (G_{t}) |$ . For each edge labeling $f = (Y_{1}, Y_{2}, \dots, Y_{t})^{T}$ , where $Y_{k} \in Z_{2}^{n_{k}}$ , $1 \leq k \leq t$ , we have $M f = {(\begin{matrix} \sum_{k = 1}^{t} Z_{k} Y_{k}^{T}, & B_{1} Y_{1}^{T}, & \dots, & B_{t} Y_{t}^{T} \end{matrix})}^{T} .$ From (1) we have $\begin{aligned} FEFI (G_{t}) & = {2 v_{f} (1) - p : f is an edge-friendlylabeling of G_{t}} \\ \subseteq {4 j - p : 0 \leq j \leq ⌊ p / 2 ⌋} \end{aligned}$ For each possible value $2 j$ of the number of $1$ -vertices, we want to find an edge-friendly labeling $f$ such that $v_{f} (1) = 2 j$ .

We deal with some special cases first.

Theorem 1. Suppose all $n_{1}, \dots, n_{t}$ are even.

Suppose there are $r$ numbers among $n_{1}, \dots, n_{t}$ such that the sum of these numbers is $q / 2$ , then
1. $F E F I (G_{t}) = {4 j - p : 0 \leq j \leq p / 2}$ if $t$ is odd;
2. $F E F I (G_{t}) = {4 j - p : 0 \leq j \leq (p - 1) / 2}$ if $t$ is even.
Suppose the sum of any combination of integers $n_{1}, \dots, n_{t}$ is not equal to $q / 2$ .
1. $F E F I (G_{t}) = {4 j - p : 1 \leq j \leq p / 2}$ if $t$ is odd;
2. $F E F I (G_{t}) = {4 j - p : 1 \leq j \leq (p - 1) / 2}$ if $t$ is even.

Proof. For each $i$ and $l$ , $1 \leq i \leq t$ and $1 \leq l \leq n_{i} / 2$ , let $Y_{i, l} = (1_{l}, 0_{l}, α_{n_{i} - 2 l}) \in Z_{2}^{n_{i}}$ . Thus, $B_{i} Y_{i, l}^{T} = (0_{l - 1}, 1, 0_{l - 1}, 1_{n_{i} - 2 l})^{T}$ and $Z_{i} Y_{i, l}^{T} = 1$ . Hence $\begin{matrix} (4) & w t (B_{i} Y_{i, l}^{T}) = n_{i} - 2 l + 1. \end{matrix}$ For $1 \leq k \leq t$ , let $f = (Y_{1, n_{1} / 2}, \dots, Y_{k - 1, n_{k - 1} / 2}, Y_{k, l}, Y_{k + 1, 1}, \dots, Y_{t, 1})^{T}$ . Thus,
$M f = (t \mod 2, B_{1} Y_{1, n_{1} / 2}^{T}, \dots, B_{k - 1}^{T} Y_{k - 1, n_{k - 1} / 2}, B_{k}^{T} Y_{k, l}, B_{k + 1}^{T} Y_{k + 1, 1}, \dots, B_{t}^{T} Y_{t, 1})^{T}$ . By (4) $\begin{matrix} (5) & v_{f} (1) = w t (M f) = (t \mod 2) + \sum_{i = 1}^{k - 1} 1 + (n_{k} - 2 l + 1) + \sum_{i = k + 1}^{t} (n_{i} - 1) \end{matrix}$

Without loss of generality, we assume $\sum_{k = 1}^{r} n_{k} = q / 2$ . Thus $\sum_{k = r + 1}^{t} n_{k} = q / 2$ . Since either $r$ or $t - r$ is at most $t / 2$ . We may assume that $r \leq ⌊ t / 2 ⌋$ and $t - r \geq ⌈ t / 2 ⌉$ .
- (1a) Suppose $t$ is odd.
  
  Step 1: For a fixed $k$ , $1 \leq k \leq t$ , let $l$ be an integer such that $1 \leq l \leq n_{k} / 2$ .
  Let $f$ be defined above, then (5) becomes
  $v_{f} (1) = w t (M f) = 1 + \sum_{i = k + 1}^{t} n_{i} + 2 k + n_{k} - 2 l - t = p - \sum_{i = 1}^{k - 1} n_{i} - 2 l + 2 k .$ For a fixed $k$ , when $l$ runs through from $1$ to $n_{k} / 2$ , the range of $v_{f} (1)$ is an increasing arithmetic sequence with common difference $2$ from $p - \sum_{i = 1}^{k} n_{i} + 2 k$ to $p - \sum_{i = 1}^{k - 1} n_{i} - 2 + 2 k$ . Thus when $k$ runs through from 1 to $t$ , the range of $v_{f} (1)$ is an increasing arithmetic sequence with common difference $2$ from $p - \sum_{i = 1}^{t} n_{i} + 2 t = t + 1$ to $p$ .
  
  Step 2: Let $R$ be the Euler tour starts from the core $c$ and travels the cycles $C_{n_{1}}$ , $C_{n_{2}}$ , $\dots$ , $C_{n_{t}}$ in order. Denote $R = u_{1} u_{2} u_{3} \dots u_{\frac{q}{2}} u_{\frac{q}{2} + 1} u_{\frac{q}{2} + 2} \dots u_{q} u_{1}$ , where $u_{1} = c$ . In this case $u_{\frac{q}{2} + 1} = c$ . There may have some $u_{i}$ ’s equal to $c$ . Let $g = (1_{\frac{q}{2}}, 0_{\frac{q}{2}})^{T}$ , then $v_{g} (1) = 0$ .
  
  Step 3: Now we swap the labels of $u_{i} u_{i + 1}$ and $u_{\frac{q}{2} + 2 i - 1} u_{\frac{q}{2} + 2 i}$ , $1 \leq i \leq ⌊ \frac{q}{2} ⌋$ , where the indices are taken in modulo $q$ . For each case, the number of 1-vertices increases by 2 if $i = 1$ or $c$ is not incident with neither $u_{i} u_{i + 1}$ nor $u_{\frac{q}{2} + 2 i - 1} u_{\frac{q}{2} + 2 i}$ ; and may not change if $c$ is incident with either $u_{i} u_{i + 1}$ or $u_{\frac{q}{2} + 2 i - 1} u_{\frac{q}{2} + 2 i}$ for $i \neq 1$ . The last case can occur at most $2 r - 1$ times. So the number of 1-vertices increases by 2 at least $\frac{q}{2} - 2 r + 1 \geq 2 t - 2 ⌊ t / 2 ⌋ + 1 \geq t + 1$ times. Thus, the number of 1-vertices runs through each even integers from 0 to $t + 1$ under the above swapping.
  
  So we obtain all the possible values of the number of 1-vertices.
- (1b) Suppose $t$ is even.
  
  Perform Step 1 as Case (1a). Now (5) becomes $v_{f} (1) = w t (M f) = 0 + \sum_{i = k + 1}^{t} n_{i} + 2 k + n_{k} - 2 l - t = p - \sum_{i = 1}^{k - 1} n_{i} - 2 l + 2 k - 1.$ Similar to Case (1a), when $k$ and $l$ run through all possible values, $v_{f} (1)$ runs through $p - 1$ , $p - 3$ , …, $t$ .
  
  Perform Steps 2 and 3 as Case (1a). We obtain that the number of 1-vertices runs through each even integers from 0 to $t$ .
  
  So we obtain all the possible values of the number of 1-vertices.

By Lemma 3, $1 \leq v_{f} (1) \leq p$ for any edge-friendly labeling $f$ . Without loss of generality, we assume that $n_{1} \geq n_{2} \geq \dots \geq n_{t}$ and $\sum_{k = 1}^{r} n_{k} < q / 2 < \sum_{k = r + 1}^{t} n_{k}$ . Here $r \leq ⌊ t / 2 ⌋$ .

(2a) Suppose $t$ is odd. Do the same Step 1 as Case (1a) to obtain the edge labeling $f$ . Thus, we obtain that $v_{f} (1)$ runs through $p$ , $p - 2$ , …, $p - \sum_{i = 1}^{t} n_{i} + 2 t = t + 1$ .

Let $R$ be an Euler tour as in Case (1a). In this case, $u_{\frac{q}{2} + 1} \neq c$ . Constructing the edge labeling $g$ as in Case (1a), we get that $v_{g} (1) = 2$ , since $g^{+} (u_{1}) = g^{+} (c) = 1$ .

Do the same Step 3 as in Case (1a). Here we obtain that the number of 1-vertices runs through each even integers from 2 to $t + 1$ .

So we obtain all the possible values of the number of 1-vertices.
(2b) Suppose $t$ is even. By a similar procedure and argument, we obtain all possible values of the number of 1-vertices.

Hence this completes the proof.

Theorem 2. Suppose all $n_{1}, \dots, n_{t}$ are odd.

Suppose there are $r$ numbers among $n_{1}, \dots, n_{t}$ such that the sum of these numbers is $⌊ q / 2 ⌋$ , then
$F E F I (G_{t}) = {4 j - p : 0 \leq j \leq (p - 1) / 2}$ .
Suppose the sum of any combination of integers $n_{1}, \dots, n_{t}$ is not equal to $⌊ q / 2 ⌋$ , then
$F E F I (G_{t}) = {4 j - p : 1 \leq j \leq (p - 1) / 2}$ .

Proof. Recall that $α_{2 l} = (1, 0, \dots, 1, 0) \in Z_{2}^{2 l}$ and $β_{2 l} = (0, 1, \dots, 0, 1) \in Z_{2}^{2 l}$ ; $1_{0}$ , $0_{0}$ , $α_{0}$ and $β_{0}$ are the empty rows (see the beginning of this section).

For a fixed $i$ , $1 \leq i \leq ⌈ t / 2 ⌉$ , let $l$ be an integer such that $1 \leq l \leq (n_{i} - 1) / 2$ . Let $Y_{i, l} = (1_{l}, 0_{l - 1}, β_{n_{i} + 1 - 2 l}) \in Z_{2}^{n_{i}}$ , then $B_{i} Y_{i, l}^{T} = (0_{l - 1}, 1, 0_{l - 1}, 1_{n_{i} - 2 l})^{T}$ and $Z_{i} Y_{i, l}^{T} = 0$ . Hence $w t (B_{i} Y_{i, l}^{T}) = n_{i} - 2 l + 1$ .

For a fixed $i$ , $⌈ t / 2 ⌉ + 1 \leq i \leq t$ , let $l$ be an integer such that $1 \leq l \leq (n_{i} - 1) / 2$ . Let $Y_{i, l} = (0, 1_{l}, 0_{l}, α_{n_{i} - 1 - 2 l}) \in Z_{2}^{n_{i}}$ , then $B_{i} Y_{i, l}^{T} = (1, 0_{l - 1}, 1, 0_{l - 1}, 1_{n_{i} - 1 - 2 l})^{T}$ and $Z_{i} Y_{i, l}^{T} = 0$ . Hence $w t (B_{i} Y_{i, l}^{T}) = n_{i} - 2 l + 1$ .

Step 1: Let $f = (Y_{1, (n_{1} - 1) / 2}, \dots, Y_{k - 1, (n_{k - 1} - 1) / 2}, Y_{k, l}, Y_{k + 1, 1}, \dots, Y_{t, 1})^{T}$ , where $1 \leq k \leq t$ and $1 \leq l \leq (n_{k} - 1) / 2$ . Clearly $f$ is edge-friendly. $\begin{aligned} v_{f} (1) = w t (M f) & = \sum_{i = 1}^{k - 1} 2 + (n_{k} - 2 l + 1) + \sum_{i = k + 1}^{t} (n_{i} - 1) \\ = p - \sum_{i = 1}^{k - 1} n_{i} - 2 l + 3 k - 2. \end{aligned}$ One may check that when $k$ and $l$ run through all possible values, $v_{f} (1)$ runs through $p - 1$ , $p - 3$ , …, $p - \sum_{i = 1}^{t} n_{i} + 3 t - 1 = 2 t$ .

Step 2: For $1 \leq i \leq ⌈ t / 2 ⌉$ , we define $Y_{i, (n_{i} + 1) / 2} = (1_{(n_{i} + 1) / 2}, 0_{(n_{i} - 1) / 2})$ , then $B_{i} Y_{i, (n_{i} + 1) / 2}^{T} = (0_{(n_{i} - 1) / 2}, 1, 0_{(n_{i} - 3) / 2})^{T}$ and $Z_{i} Y_{i, (n_{i} + 1) / 2}^{T} = 1$ . Hence $w t (B_{i} Y_{i, (n_{i} + 1) / 2}^{T}) = 1$ .

For $⌈ t / 2 ⌉ + 1 \leq i \leq t$ , we define $Y_{i, (n_{i} + 1) / 2} = (1_{(n_{i} - 1) / 2}, 0_{(n_{i} + 1) / 2})$ . Here $B_{i} Y_{i, (n_{i} + 1) / 2}^{T} = (0_{(n_{i} - 3) / 2}, 1, 0_{(n_{i} - 1) / 2})^{T}$ and $Z_{i} Y_{i, (n_{i} + 1) / 2}^{T} = 1$ . Hence $w t (B_{i} Y_{i, (n_{i} + 1) / 2}^{T}) = 1$ .

For each $k$ , $1 \leq k \leq t$ , let $f_{k} = (Y_{1, (n_{1} + 1) / 2}, \dots, Y_{k, (n_{k} + 1) / 2}, Y_{k + 1, (n_{k + 1} - 1) / 2}, \dots, Y_{t, (n_{t} - 1) / 2})^{T}$ . Note that, $f_{t} = (Y_{1, (n_{1} + 1) / 2}, \dots, Y_{t, (n_{t} + 1) / 2})^{T}$ . Clearly $f_{k}$ is edge-friendly. Suppose $k$ is even. We have $v_{f_{k}} (1) = w t (M f_{k}) = ({\sum_{i = 1}^{k} 1 \mod 2} + k) + 2 (t - k) = (0 + k) + 2 (t - k) = 2 t - k$ .

One may check that when $k$ runs through all even numbers from $2$ to $t$ , $v_{f_{k}} (1)$ runs through all even numbers from $2 t - 2$ down to $t$ .

Now we shall perform some steps similar to Steps 2 and 3 in the proof of Theorem 1 to obtain the remaining possible values of the number of 1-vertices.

Without loss of generality, we assume that $\sum_{k = 1}^{r} n_{k} = ⌊ q / 2 ⌋$ . Here $r \leq ⌊ t / 2 ⌋$ .

Let $R = u_{1} u_{2} u_{3} \dots u_{⌊ q / 2 ⌋} u_{⌊ q / 2 ⌋ + 1} u_{⌊ q / 2 ⌋ + 2} \dots u_{q} u_{1}$ be the Euler tour starts from the core $u_{1} = c$ and travels the cycles $C_{n_{1}}$ , $C_{n_{2}}$ , $\dots$ , $C_{n_{t}}$ in order. By convention $u_{q + 1} = u_{1}$ .

Step 3: Define $g = (1_{⌊ q / 2 ⌋}, 0_{⌈ q / 2 ⌉})^{T}$ . Now $v_{g} (1) = 0$ .

Step 4:
1. When $q = 4 m + 1$ , where $m \geq 2$ . Note that $u_{2 m + 1} = c$ , $4 m + 1 = \sum_{i = 1}^{t} n_{i} \geq 3 t$ and $t$ is odd. Swap the labels of $u_{i} u_{i + 1}$ and $u_{2 m + 2 i - 1} u_{2 m + 2 i}$ , $1 \leq i \leq m + 1$ . The number of 1-vertices increases by 2 at least $(m + 1) - (r - 1)$ times, since the first swapping increases $v_{g} (1)$ by 2.
  
  Next, swap the labels of $u_{m + 1 + i} u_{m + 2 + i}$ and $u_{2 i - 1} u_{2 i}$ , $1 \leq i \leq m - 1$ . So the number of 1-vertices increases by 2 at least $m - 1 - r$ times.
  
  By the same argument as Step 3 in the proof of Theorem 1, the number of 1-vertices increases by 2 at least $2 m + 1 - 2 r \geq (3 t - 1) / 2 + 1 - t = (t + 1) / 2$ times totally. Thus, the number of 1-vertices runs through each even integer from 0 to $t + 1$ under the above swapping.
2. When $q = 4 m + 3$ , where $m \geq 2$ (in this case $q$ cannot be 7). Note that $u_{2 m + 2} = c$ , $4 m + 3 = \sum_{i = 1}^{t} n_{i} \geq 3 t$ and $t$ is odd.
  
  Swap the labels of $u_{i} u_{i + 1}$ and $u_{2 m + 2 i} u_{2 m + 2 i + 1}$ , $1 \leq i \leq m + 1$ . Next, swap the labels of $u_{m + 1 + i} u_{m + 2 + i}$ and $u_{2 i - 1} u_{2 i}$ , $1 \leq i \leq m$ .
  
  Totally, the number of 1-vertices increases by 2 at least $(2 m + 1) - 2 r + 1 \geq (3 t - 3) / 2 + 2 - t = (t + 1) / 2$ times. Thus, the number of 1-vertices runs through each even integer from 0 to $t + 1$ under the above swapping.
3. When $q = 4 m$ , where $m \geq 3$ (in this case $q$ cannot be 8). Note that $u_{2 m} = c$ , $4 m = \sum_{i = 1}^{t} n_{i} \geq 3 t$ and $t$ is even.
  
  Swap the labels of $u_{i} u_{i + 1}$ and $u_{2 m + 2 i - 1} u_{2 m + 2 i}$ , $1 \leq i \leq m$ . Next, swap the labels of $u_{m + i} u_{m + i + 1}$ and $u_{2 i - 1} u_{2 i}$ , $1 \leq i \leq m - 1$ .
  
  Totally, the number of 1-vertices increases by 2 at least $(2 m - 1) - 2 r + 1 \geq 3 t / 2 - t = t / 2$ times. Thus, the number of 1-vertices runs through each even integer from 0 to $t$ under the above swapping.
4. When $q = 4 m + 2$ , where $m \geq 1$ . Note that $u_{2 m + 1} = c$ , $4 m + 2 = \sum_{i = 1}^{t} n_{i} \geq 3 t$ and $t$ is even.
  
  Swap the labels of $u_{i} u_{i + 1}$ and $u_{2 m + 2 i} u_{2 m + 2 i + 1}$ , $1 \leq i \leq m + 1$ . Next, swap the labels of $u_{m + 1 + i} u_{m + i + 2}$ and $u_{2 i - 1} u_{2 i}$ , $1 \leq i \leq m$ .
  
  Totally, the number of 1-vertices increases by 2 at least $(2 m + 1) - 2 r + 1 \geq 3 t / 2 + 1 - t = t / 2 + 1$ times. Thus, the number of 1-vertices runs through each even integer from 0 to $t + 2$ under the above swapping.
Without loss of generality, we assume that $n_{1} \geq n_{2} \geq \dots \geq n_{t}$ and $\sum_{k = 1}^{r} n_{k} < q / 2 < \sum_{k = r + 1}^{t} n_{k}$ . Here $r \leq ⌊ t / 2 ⌋$ . We do the same procedure as Case 1. The only difference is $v_{g} (1) = 2$ . Hence the number of 1-vertices at least runs through each even integer from 2 to $t$ under the above swapping.

This completes the proof.

Example 1. Consider the graph $C_{5} ⊎ C_{3} ⊎ C_{3} ⊎ C_{3} ⊎ C_{3}$ . Here $t = 5$ , $p = 13$ , $q = 17$ , $m = 4$ and $r = 2$ . Let $R = u_{1} u_{2} \dots u_{17} u_{1}$ be an Euler tour of the graph, where $u_{1} = u_{6} = u_{9} = u_{12} = u_{15} = c$ . For $1 \leq i \leq 17$ , let $e_{i} = u_{i} u_{i + 1}$ , where $u_{18} = u_{1}$ .

The procedure of Steps 2 listed below: $\begin{array}{ccccccccccccccccccc} e_{1} & e_{2} & e_{3} & e_{4} & e_{5} & e_{6} & e_{7} & e_{8} & e_{9} & e_{10} & e_{11} & e_{12} & e_{13} & e_{14} & e_{15} & e_{16} & e_{17} & v (1) \\ f_{1} & 1 & 1 & 1 & 0 & 0 & 1 & 0 & 1 & 1 & 0 & 1 & 0 & 1 & 0 & 0 & 1 & 0 & 10 \\ f_{2} & 1 & 1 & 1 & 0 & 0 & 1 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 0 & 1 & 0 & 8 \\ f_{3} & 1 & 1 & 1 & 0 & 0 & 1 & 1 & 0 & 1 & 1 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 8 \\ f_{4} & 1 & 1 & 1 & 0 & 0 & 1 & 1 & 0 & 1 & 1 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 6 \\ f_{5} & 1 & 1 & 1 & 0 & 0 & 1 & 1 & 0 & 1 & 1 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 6 \end{array}$

The procedure of swapping (Steps 3 and 4) listed below start from $g = (1_{8}, 0_{9})$ .
$\begin{array}{ccccccccccccccccccc} e_{1} & e_{2} & e_{3} & e_{4} & e_{5} & e_{6} & e_{7} & e_{8} & e_{9} & e_{10} & e_{11} & e_{12} & e_{13} & e_{14} & e_{15} & e_{16} & e_{17} & v (1) \\ g & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 2 \\ 0 & 0 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 4 \\ 0 & 0 & 0 & 1 & 1 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 1 & 0 & 0 & 0 & 0 & 6 \\ 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 0 & 6 \\ 0 & 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 6 \\ 1 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 8 \\ 1 & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 10 \\ 1 & 0 & 1 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 10 \end{array}$

Example 2. Consider the graph $C_{3} ⊎ C_{3}$ . Here $t = 2$ , $p = 5$ , $q = 6$ , $m = 1$ and $r = 1$ . Let $R = u_{1} u_{2} \dots u_{6} u_{1}$ be an Euler tour of the graph, where $u_{1} = u_{4} = c$ . For $1 \leq i \leq 6$ , let $e_{i} = u_{i} u_{i + 1}$ , where $u_{7} = u_{1}$ .

The procedure of Steps 3 and 4 listed below start from $g = (1_{3}, 0_{3})$ . $\begin{array}{cccccccc} e_{1} & e_{2} & e_{3} & e_{4} & e_{5} & e_{6} & v (1) \\ g & 1 & 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 1 & 1 & 1 & 0 & 0 & 2 \\ 0 & 0 & 1 & 1 & 0 & 1 & 4 \\ 1 & 0 & 0 & 1 & 0 & 1 & 4 \end{array}$

Lemma 4. Let $G$ and $H$ be two graphs with only one common vertex $u$ . Suppose $f_{G}$ and $f_{H}$ be two edge-friendly labelings of $G$ and $H$ , respectively. If $(f_{G}^{+} (u), f_{H}^{+} (u)) \neq (1, 1)$ , then there is an edge-friendly labeling $h$ of $G ⊎ H$ such that $v_{h} (1) = v_{f_{G}} (1) + v_{f_{H}} (1)$ . If $(f_{G}^{+} (u), f_{H}^{+} (u)) = (1, 1)$ , then there is an edge-friendly labeling $h$ of $G ⊎ H$ such that $v_{h} (1) = v_{f_{G}} (1) + v_{f_{H}} (1) - 2$ .

Proof. Let $h$ be the combined labeling of $f_{G}$ and $f_{H}$ . We obtain the lemma easily.

Theorem 3. Let $p$ and $q$ be the order and the size of $G_{t}$ , respectively.

Suppose there are $r$ numbers among $n_{1}, \dots, n_{t}$ such that the sum of these numbers is $⌊ q / 2 ⌋$ , then $F E F I (G_{t}) = {4 j - p : 0 \leq j \leq ⌊ p / 2 ⌋}$ .
Suppose there are no $r$ numbers among $n_{1}, \dots, n_{t}$ such that the sum of these numbers are $⌊ q / 2 ⌋$ , then $F E F I (G_{t}) = {4 j - p : 1 \leq j \leq ⌊ p / 2 ⌋}$ .

Proof. Without loss of generality, we assume that $n_{1}, \dots, n_{s}$ are even and $n_{s + 1}, \dots, n_{t}$ are odd, where $0 \leq s \leq t$ . When $s = 0$ or $s = t$ , we get the results using Theorem 1 and Theorem 2.

By Lemma 3, it suffices to find an edge-friendly labeling $f$ of $G_{t}$ such that $v_{f} (1)$ runs through all even numbers in $[2, p]$ .

Let $G = ⨄_{i = 1}^{s} C_{n_{i}}$ and $H = ⨄_{i = s + 1}^{t} C_{n_{i}}$ . Let $p_{G}$ and $p_{H}$ be orders of $G$ and $H$ , respectively. Note that $p_{H}$ is odd and $p = p_{G} + p_{H} - 1$ .

By Theorem 1 there is an edge-friendly labeling $f_{G}$ of $G$ such that $v_{f_{G}} (1)$ at least runs through all even numbers of $[2, p_{G}]$ , and by Theorem 2 there is an edge-friendly labeling $f_{H}$ of $H$ such that $v_{f_{H}} (1)$ at least runs through all even numbers of $[2, p_{H} - 1]$ .

By Lemma 4, in the worst case, there is an edge-friendly labeling $h$ of $G ⊎ H$ such that $v_{h} (1)$ runs through all even numbers of $[4, p_{G} + p_{H} - 1 - 2] = [4, p - 2]$ .

Now we only need to find an edge-friendly labeling $g$ of $G ⊎ H$ such that $v_{g} (1)$ is $p$ when $p$ is even, or $p - 1$ when $p$ is odd, or else, $v_{g} (1)$ is 2 (see 1⃝ and 2⃝ below).

Let $R = u_{1} u_{2} u_{3} \dots u_{⌊ q / 2 ⌋} u_{⌊ q / 2 ⌋ + 1} u_{⌊ q / 2 ⌋ + 2} \dots u_{q} u_{1}$ be the Euler tour of $G_{t}$ starts from the core $u_{1} = c$ . Note that $q = p + t - 1$ and $\deg (c) = 2 t$ .

When $q$ is even, $p \equiv t - 1 (\mod 2)$ . Define $g = (1, 0, 1, 0, \dots, 1, 0)^{T} \in Z_{2}^{q}$ , then $g^{+} (c) = t \mod 2$ . Hence $v_{g} (1) = {\begin{cases} p & if t isodd, \\ p - 1 & if t is even, \end{cases} = {\begin{cases} p & if p is even, \\ p - 1 & if p is odd. \end{cases}$

When $q$ is odd, $p \equiv t (\mod 2)$ . Define $g = (1, 0, 1, 0, \dots, 1, 0, 1)^{T} \in Z_{2}^{q}$ , then $g^{+} (c) = t + 1 \mod 2$ . Hence $v_{g} (1) = {\begin{cases} p - 1 & if t isodd, \\ p & if t is even, \end{cases} = {\begin{cases} p - 1 & if p is odd, \\ p & if p is even. \end{cases}$
Suppose $u_{⌊ q / 2 ⌋ + 1} \neq c$ . Define $g = (1_{⌊ q / 2 ⌋}, 0_{⌈ q / 2 ⌉})^{T}$ . Thus only $g^{+} (c) = g^{+} (u_{⌊ q / 2 ⌋ + 1}) = 1$ . Hence $v_{g} (1) = 2$ .

Suppose $u_{⌊ q / 2 ⌋ + 1} = c$ , then $u_{2} \neq c$ and $u_{⌊ q / 2 ⌋ + 2} \neq c$ . Define $g = (0, 1_{⌊ q / 2 ⌋}, 0_{⌈ q / 2 ⌉ - 1})^{T}$ . Thus only $g^{+} (u_{2}) = g^{+} (u_{⌊ q / 2 ⌋ + 2}) = 1$ . Hence $v_{g} (1) = 2$ .

This completes the proof.

We denote the graph $G_{t}$ by $C_{n}^{(t)}$ when $n_{1} = \dots = n_{t} = n$ . When $n = 3$ , $C_{3}^{(t)}$ is called the Dutch $t$ -windmill graph. By Theorem 3, we have the following corollaries.

Corollary 1. Suppose $n \geq 3$ and $t \geq 2$ . Now, the order of $C_{n}^{(t)}$ is $p = n t - t + 1$ .

Suppose $n$ is odd, then $F E F I (C_{n}^{(t)}) = {\begin{cases} {4 j - p : 1 \leq j \leq (p - 1) / 2} & if t is odd; \\ {4 j - p : 0 \leq j \leq (p - 1) / 2} & if t is even . \end{cases}$
Suppose $n$ is even, then $F E F I (C_{n}^{(t)}) = {\begin{cases} {4 j - p : 1 \leq j \leq p / 2} & if t is odd; \\ {4 j - p : 0 \leq j \leq (p - 1) / 2} & if t is even . \end{cases}$

Corollary 2. For $t \geq 2$ , $F E F I (C_{3}^{(t)}) = {\begin{cases} {4 j - 2 t - 1 : 1 \leq j \leq t} & if t is odd; \\ {4 j - 2 t - 1 : 0 \leq j \leq t} & if t is even . \end{cases}$

Funding

The first author was partially supported by National Natural Science Foundation of China (No: 12371344).

Financial Interests

The authors have no relevant financial or non-financial interests to disclose.

Author Contributions

All authors contributed to the study conception and design. Material preparation and analysis were performed by all the authors. The first draft of the manuscript was written by Zhen-Bin Gao and all authors commented on previous versions of the manuscript. All authors read and approved the final manuscript.

References:

Bondy, J. A. and Murty, U. S. R., 1976. Graph Theory with Applications. Macmillan.
Gallian, J. A., 2021. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics, #DS6.
Rosa, A., 1967. On certain valuations of the vertices of a graph. In Theory of Graphs (Internat. Symposium, Rome, July 1966) (pp. 349–355). Gordon and Breach.
Graham, R. L., and Sloane, N. J. A., 1980. On additive bases and harmonious graphs. SIAM Journal on Algebraic and Discrete Methods,1(4), pp.382–404.
Shiu, W. C., 2016. Extreme edge-friendly indices of complete bipartite graphs. Transactions on Combinatorics,5(3), pp.11–21.
Shiu, W. C., 2017. Full edge-friendly index sets of complete bipartite graphs. Transactions on Combinatorics, 6(2), pp.7–17.

[1] Bondy, J. A. and Murty, U. S. R., 1976. Graph Theory with Applications. Macmillan.

[2] Gallian, J. A., 2021. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics, #DS6.

[3] Rosa, A., 1967. On certain valuations of the vertices of a graph. In Theory of Graphs (Internat. Symposium, Rome, July 1966) (pp. 349–355). Gordon and Breach.

[4] Graham, R. L., and Sloane, N. J. A., 1980. On additive bases and harmonious graphs. SIAM Journal on Algebraic and Discrete Methods,1(4), pp.382–404.

[5] Shiu, W. C., 2016. Extreme edge-friendly indices of complete bipartite graphs. Transactions on Combinatorics,5(3), pp.11–21.

[6] Shiu, W. C., 2017. Full edge-friendly index sets of complete bipartite graphs. Transactions on Combinatorics, 6(2), pp.7–17.

Contents

Ars Combinatoria

Full Edge-Friendly Index Sets of One Point Union of Cycles

Abstract

1. Introduction

2. Some Extrema of Edge-Friendly Indices

3. Full Edge-Friendly Index Sets

Funding

Financial Interests

Author Contributions

References:

Information

Guidelines

CP Initiatives

Follow CP