Vous êtes sur la page 1sur 30

The Rainbow Vertex

Connection Number of
Star Wheel Graphs
ARIESTHA WIDYASTUTY BUSTAN
M SALMAN A.N
INTRODUCTION
A vertex-colored graph 𝐺 = 𝑉 𝐺 , 𝐸 𝐺 is said to be rainbow
vertex-connected, if for every two vertices 𝑢 and 𝑣 in 𝑉 𝐺 , there
exists a 𝑢 − 𝑣 path with all internal vertices have distinct colors.

The rainbow vertex connection number of 𝑮 , denoted by


𝑟𝑣𝑐 𝐺 , is the smallest number of colors needed to make 𝐺
rainbow vertex connected.
INTRODUCTION
Let 𝐺 be a connected graph, 𝑛 be the size of 𝐺, and diameter of 𝐺
denoted by 𝑑𝑖𝑎𝑚(𝐺), then they stated that
𝒅𝒊𝒂𝒎 𝑮 − 𝟏 ≤ 𝒓𝒗𝒄 𝑮 ≤ 𝒏 − 𝟐 (1)
𝒓𝒗𝒄(𝑮) ≥ 𝒄 (2)
𝒓𝒗𝒄 𝑮 = 𝟎 if 𝐺 is a complete graph. (3)
STAR WHEEL GRAPHS
Star wheel graphs are divided into two classes based on the selection
of a vertex of the wheel graph, a vertex on the cycle and the central
vertex in the wheel.
MAIN RESULTS (1)
Definition 1. Let 𝑚 and 𝑛 be two integers at least 3, 𝑆𝑚 be a star with 𝑚 + 1
vertices. 𝑊𝑛 be a wheel with 𝑛 + 1 vertices, 𝑣 ∈ 𝑉(𝑊𝑛 ) and 𝑣 is a vertex on the
cycle. A star wheel graph is a graph obtained by embedding a copy of 𝑊𝑛 to each
pendant of 𝑆𝑚 , denoted by 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 𝑖 ∈ 1, 𝑚 , such that the vertex set
and the edge set, respectively, as follows.
𝑉 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑣𝑖,𝑗 𝑖, 𝑗 ∈ 1, 𝑚 ∪ 𝑣𝑖,𝑚+1 𝑖 ∈ 1, 𝑚 ∪ 𝑣𝑚+1 ,

𝐸 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑣𝑚+1 𝑣𝑖,1 𝑖 ∈ [1, 𝑚]} ∪ {𝑣𝑖,𝑗 𝑣𝑖,𝑗+1 𝑖 ∈ 1, 𝑚 , 𝑗 ∈


THEOREM 1
Theorem 1. Let 𝑚 and 𝑛 be two integers at least 3 and
𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 be a star wheel graph, then
𝑚 + 1, 𝑚 ≥ 𝑛 𝑜𝑟 𝑚 < 𝑛, 𝑚 ≥ 4, 𝑛 = 𝑚 + 𝑘, 𝑘 ∈ [1, 𝑚 − 3]
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑖, 𝑚 < 𝑛, 𝑛 = 𝑖 𝑚 − 1 , 𝑖 𝑚 − 1 + 1 , 𝑖 ∈ [2, 𝑚]
2𝑚 + 1, 𝑜𝑡ℎ𝑒𝑟𝑠
PROOF (Case 1. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 1)
Based on equation (2), we have
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≥𝑐 =𝑚+1 (3)

In order to proof that 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≤ 𝑚 + 1, define a vertex-coloring 𝛼: 𝑉 𝑆 𝑚, 𝑊𝑛 , 𝑣 →


[1, 𝑚 + 1] as follows.
𝑖, 𝑗 = 1, 𝑖 ∈ [1, 𝑚]
𝑖 + 1 𝑚𝑜𝑑 𝑚, 𝑗 = 𝑛 + 1 𝑎𝑛𝑑 𝑖, 𝑗 ∈ [1, 𝑚]
𝑛
𝑖 + 𝑗 + 1 𝑚𝑜𝑑 𝑚, 𝑗 ∈ 2, , 𝑖 ∈ [1, 𝑚]
2
𝛼 𝑣𝑖,𝑗 = 𝑛 𝑛 𝑛
𝑖+𝑗 − −1 , 𝑗 ∈ + 1, 𝑛 , 𝑖 ∈ 1, 𝑚 , 𝑖 + 𝑗 < 𝑚 +
2 2 2
𝑛 𝑛 𝑛
𝑖 + 𝑗 𝑚𝑜𝑑 𝑚 + −1 , 𝑗 ∈ + 1, 𝑛 , 𝑖 ∈ 1, 𝑚 , 𝑖 + 𝑗 ≥ 𝑚 +
2 2 2
𝑚 + 1, 𝑜𝑡ℎ𝑒𝑟𝑠
PROOF (Case 1. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 1)
We are able to find a rainbow path for every pair vertices 𝑢 and 𝑣 in 𝑉 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 as
shown in table 1
𝑢 𝑣 Condition Rainbow-vertex path
𝑢 is adjacent to v trivial
𝑣𝑖,𝑗 𝑣𝑖,𝑘 𝑗≠𝑘 𝑣𝑖,𝑗 , 𝑣𝑖,𝑚+1 , 𝑣𝑖,𝑘
𝑖 ∈ 1, 𝑚
𝑗, k ∈ [1, 𝑛]
𝑣𝑖,1 𝑣𝑗,1 𝑖≠𝑗 𝑣𝑖,1 , 𝑣𝑚+1 , 𝑣j,1
𝑖, 𝑗 ∈ [1, 𝑚]
𝑣𝑖,𝑗 𝑣𝑘,𝑙 𝑖≠𝑘 𝑣𝑖, 𝑛 +1, 𝑣𝑖, 𝑛 , 𝑣𝑖, 𝑛 −1 , … , 𝑣𝑖,2 , 𝑣𝑖,1 , 𝑣𝑚+1 , 𝑣𝑘,𝑙 , 𝑣𝑘,𝑛+1
2 2 2
𝑖, 𝑘 ∈ 1, 𝑚
and
𝑗, 𝑙 ∈ [1, 𝑚 + 1]
𝑣𝑖, 𝑛 +2, 𝑣𝑖, 𝑛 +3 , … , 𝑣𝑖,𝑛 , 𝑣𝑖,1 , 𝑣𝑚+1 , 𝑣𝑘,𝑙 , 𝑣𝑘,𝑛+1
𝑘 = 𝑖 + 1 𝑚𝑜𝑑 𝑚 2 2
𝑜𝑟 𝑘 = 𝑖 − 1 𝑚𝑜𝑑 𝑚
𝑣𝑖,𝑗 𝑣𝑘,𝑙 others 𝑣𝑖,𝑗, 𝑣𝑖,𝑛+1 , 𝑣𝑖,1 , 𝑣𝑚+1 , 𝑣𝑘,1 , 𝑣𝑘,𝑛+1, 𝑣𝑘,𝑙
PROOF (Case 1. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 1)

So we conclude that
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≤𝑚+1 (4)

From equation (3) and (4), we have


𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 1
PROOF (Case 2. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑎)

We divide a proof into two subcases


Subcase 2.1 𝑚 = 3 𝑎𝑛𝑑 𝑛 = 4,5
Based on equation (1), we have 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≥ 𝑑𝑖𝑎𝑚 −
1 = 𝑚 + 2. We may define a rainbow vertex (𝑚 + 2)-coloring on
𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 as shown in Fig 2. It is not difficult to verify that all
graphs are rainbow vertex connected.
PROOF (Case 2. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑎)

Figure 2. 𝑆 3, 𝑊4 , 𝑣𝑖,1 𝑎𝑛𝑑 𝑆(3, 𝑊5 , 𝑣𝑖,1 )


PROOF (Case 2. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑎)
Suppose that 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≥
𝑚 + 𝑎 − 1. There is a rainbow vertex
𝑚 + 𝑎 − 1-coloring on 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 .
Without loss of generality, color the
vertices as follows:
𝑣𝑚+1 = 𝑚 + 1
𝑣𝑖,1 = 𝑖, 𝑖 ∈ [1, 𝑚]
Look at the vertex 𝑣𝑖,1 and 𝑣𝑖,𝑛+1 who
can not use the same color.
PROOF (Case 2. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑎)
If it has the same color, then the
color that is in 𝑣𝑖, 𝑛 , 𝑣𝑖, 𝑛 −1 , … , 𝑣𝑖,2
2 2
or 𝑣𝑖, 𝑛 +2 , 𝑣𝑖, 𝑛 +3 , … , 𝑣𝑖,𝑛 has
2 2
different colors with cut vertices,
contradiction. Then, look at vertex
𝑣𝑖, 𝑛 +1 and 𝑣𝑗, 𝑛 +1 , 𝑖, 𝑗 ∈
2 2
1, 𝑚 𝑎𝑛𝑑 𝑖 ≠ 𝑗.
PROOF (Case 2. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑎)
To obtain rainbow vertex path between
them, should be passed every vertex
𝑣𝑖,𝑛+1 . Because of graph 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1
have 𝑚 + 𝑎 − 1 colors, then the colors
in the vertex 𝑣𝑖,𝑛+1 has two possibility
colors. First, being colored by the color
which used at the cut vertices,
otherwise being color with 𝑘 , then
there is no rainbow vertex path
between 𝑣𝑖, 𝑛 +1 and 𝑣𝑘, 𝑛 +1 , 𝑖, 𝑘 ∈
2 2
[1, 𝑚].
PROOF (Case 2. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑎)

Second, being colored with the color that is


not in cut vertices. Because graph
𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 has 𝑚 vertex 𝑣𝑖,𝑛+1 , then it
certainly at least two vertices 𝑣𝑖,𝑛+1 who
has the same colors, such as 𝑣𝑘,𝑛+1 and
𝑣𝑙,𝑛+1 .It’s impacted, there is no rainbow
vertex path between vertex 𝑣𝑘, 𝑛 +1 and
2
𝑣𝑙, 𝑛 +1 .
2
PROOF (Case 2. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑎)
So that, graph 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 cannot be colored with 𝑚 + 𝑎 − 1 colors. So we obtain

𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≥𝑚+𝑎 (5)

In order to proof 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≤ 𝑚 + 𝑎, define a vertex-coloring 𝛼: 𝑉 𝑆 𝑚, 𝑊𝑛 , 𝑣 →


[1, 𝑚 + 𝑎] as follows.
𝑖, 𝑗 = 1, 𝑖 ∈ [1, 𝑚]
𝑖 + 1 𝑚𝑜𝑑 (𝑚 + 1), 𝑗 = 𝑛 + 1 𝑎𝑛𝑑 𝑖, 𝑗 ∈ [1, 𝑚]
𝑛
𝑖 + 𝑗 + 1 𝑚𝑜𝑑 𝑚 + 𝑖 − 1, 𝑗 ∈ 2, , 𝑖 ∈ [1, 𝑚]
2
𝛼 𝑣𝑖,𝑗 = 𝑛 𝑛
𝑖+𝑗 − −1 , 𝑗 ∈ + 1, 𝑛 , 𝑖 ∈ 1, 𝑚 , 𝑖 + 𝑗 < 𝑛 + 1
2 2
𝑛
𝑖 + 𝑗 𝑚𝑜𝑑 𝑛 + 1 , 𝑗 ∈ 2
+ 1, 𝑛 , 𝑖 ∈ 1, 𝑚 , 𝑖 + 𝑗 ≥ 𝑛 + 2
𝑚 + 𝑖, 𝑜𝑡ℎ𝑒𝑟𝑠
PROOF (Case 2. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑎)
We are able to find a rainbow path for every pair vertices 𝑢 and 𝑣 in 𝑉 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 as
shown in table 2
Table 2. Rainbow vertex-path
𝑢 𝑣 Condition Rainbow-vertex path
𝑢 is adjacent to v trivial
𝑣𝑖,𝑗 𝑣𝑖,𝑙 𝑗≠𝑘 𝑣𝑖,𝑗 , 𝑣𝑖,𝑚+1 , 𝑣𝑖,𝑘
𝑖 ∈ 1, 𝑚
𝑗 ∈ [1, 𝑛]
𝑣𝑖,1 𝑣𝑗,1 𝑖≠𝑗 𝑣𝑖,1 , 𝑣𝑚+1 , 𝑣𝑘,1
𝑖, 𝑗 ∈ [1, 𝑚]
𝑣𝑖,𝑗 𝑣𝑘,𝑙 𝑖≠𝑘 𝑣𝑖, 𝑛 +1, 𝑣𝑖, 𝑛 , 𝑣𝑖, 𝑛 −1 , … , 𝑣𝑖,2 , 𝑣𝑖,1 , 𝑣𝑚+1 , 𝑣𝑘,𝑙 , 𝑣𝑘,𝑛+1
2 2 2
𝑖, 𝑘 ∈ 1, 𝑚
and
𝑗, 𝑙 ∈ [1, 𝑚 + 1]
𝑣𝑖, 𝑛 +2, 𝑣𝑖, 𝑛 +3 , … , 𝑣𝑖,𝑛 , 𝑣𝑖,1 , 𝑣𝑚+1 , 𝑣𝑘,𝑙 , 𝑣𝑘,𝑛+1
𝑘 = 𝑖 + 1 𝑚𝑜𝑑 𝑚 2 2
𝑜𝑟 𝑘 = 𝑖 − 1 𝑚𝑜𝑑 𝑚
𝑣𝑖,𝑗 𝑣𝑘,𝑙 others 𝑣𝑖,𝑗, 𝑣𝑖,𝑛+1 , 𝑣𝑖,1 , 𝑣𝑚+1 , 𝑣𝑘,1 , 𝑣𝑘,𝑛+1, 𝑣𝑘,𝑙
PROOF (Case 2. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑎)
So we conclude that
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≤𝑚+𝑎 (6)
From equation (5) and (6), we have
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑎
PROOF (Case 3. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 2𝑚 + 1)
Suppose that
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≥ 2𝑚. There
is a rainbow vertex 2𝑚-coloring on
𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 . Without loss of
generality, color the vertices as
follows:
𝑣𝑚+1 = 𝑚 + 1
𝑣𝑖,1 = 𝑖, 𝑖 ∈ [1, 𝑚]
PROOF (Case 3. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 2𝑚 + 1)
To obtain rainbow vertex path between
𝑣𝑖, 𝑛 +1 and 𝑣𝑗, 𝑛 +1 , 𝑖, 𝑗 ∈ 1, 𝑚 , 𝑖 ≠ 𝑗, then
2 2
every vertex 𝑣𝑖,𝑛+1 and cut vertices have
distinct colors. If it is has the same color,
there is no rainbow vertex path between
𝑣𝑖, 𝑛 +1 and 𝑣𝑘, 𝑛 +1 , 𝑖, 𝑘 ∈ [1, 𝑚]. But,
2 2
𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 just have 2𝑚 colors,
contradiction. So that, graph 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1
cannot be colored with 2𝑚 colors. So, we
obtain
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≥ 2𝑚 + 1 (7)
PROOF (Case 3. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 2𝑚 + 1)
In order to proof that
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≤ 2𝑚 + 1, define a
vertex-coloring 𝛼: 𝑉 𝑆 𝑚, 𝑊𝑛 , 𝑣 →
[1,2𝑚 + 1] as follows.
𝛼 𝑣𝑖,𝑗 =
𝒊, 𝑓𝑜𝑟 𝑗 = 1 𝑎𝑛𝑑 𝑖 ∈ [1, 𝑚]
𝒊 + 𝒎, 𝑓𝑜𝑟 𝑗 = 𝑛 + 1, 𝑖 ∈ [1, 𝑚]
𝟐𝒎 + 𝟏, 𝑜𝑡ℎ𝑒𝑟𝑠
PROOF (Case 3. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 2𝑚 + 1)
We are able to find a rainbow path for every pair vertices 𝑢 and 𝑣 in
𝑉 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 as shown in table 3.
Table 3. Rainbow vertex-path

𝑢 𝑣 Condition Rainbow-vertex path


𝑢 is adjacent to v trivial
𝑣𝑖,𝑗 𝑣𝑘,𝑙 𝑖, 𝑘 ∈ [1, 𝑚] 𝑣𝑖,𝑗, 𝑣𝑖,𝑛+1 , 𝑣𝑖,1 , 𝑣𝑚+1 , 𝑣𝑘,1 , 𝑣𝑘,𝑛+1, 𝑣𝑘
𝑗, 𝑙 ∈ [1, 𝑚 + 1]
PROOF (Case 3. 𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 2𝑚 + 1)
So we conclude that
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≤ 2𝑚 + 1 (8)
From equation (7) and (8), we have
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 2𝑚 + 1
MAIN RESULTS (2)
Definition 2. Let 𝑚 and 𝑛 be two integers at least 3, 𝑆𝑚 be a star with 𝑚 + 1
vertices. 𝑊𝑛 be a wheel with 𝑛 + 1 vertices, 𝑣 ∈ 𝑉(𝑊𝑛 ) and 𝑣 is the central
vertex in the wheel. A star wheel graph is a graph obtained by embedding a copy
of 𝑊𝑛 to each pendant of 𝑆𝑚 , denoted by 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 𝑖 ∈ 1, 𝑚 , such that
the vertex set and the edge set, respectively, as follows.
𝑉 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 = 𝑣𝑖,𝑗 𝑖, 𝑗 ∈ 1, 𝑚 ∪ 𝑣𝑖,𝑚+1 𝑖 ∈ 1, 𝑚 ∪ 𝑣𝑚+1 ,

𝐸 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 = 𝑣𝑚+1 𝑣𝑖,1 𝑖 ∈ [1, 𝑚]} ∪ {𝑣𝑖,𝑗 𝑣𝑖,𝑗+1 𝑖 ∈ 1, 𝑚 , 𝑗 ∈


MAIN RSULTS (2)
Theorem 2. Let 𝑚 and 𝑛 be two integers at least 3 and 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 be a
star wheel graph, then
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 =𝑚 + 1
Proof.
Based on equation (2), we have
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 ≥𝑐 =𝑚+1 (9)
PROOF (𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 =𝑚 + 1)
In order to proof that
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 ≤ 𝑚 + 1, define a
vertex-coloring 𝛼: 𝑉 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 →
[1, 𝑚 + 1] as follows.
𝑖, 𝑓𝑜𝑟 𝑗 = 𝑚 + 1
𝛼 𝑣𝑖,𝑗 =
𝑚 + 1, 𝑜𝑡ℎ𝑒𝑟𝑠
PROOF (𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 =𝑚 + 1)
We are able to find a rainbow path for every pair vertices 𝑢 and 𝑣 in
𝑉 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 as shown in table 4
Table 4. Rainbow vertex-path
𝑢 𝑣 condition Rainbow-vertex path
𝑢 is adjacent to v trivial
𝑣𝑖,𝑗 𝑣𝑘,𝑙 𝑖, 𝑘 ∈ [1, 𝑚] 𝑣𝑖,𝑗, 𝑣𝑖,𝑚+1 , 𝑣𝑚+1 , 𝑣𝑘,𝑚+1, 𝑣𝑘,𝑙
𝑗, 𝑙 ∈ [1, 𝑚 + 1]
PROOF (𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 =𝑚 + 1)
So we conclude that
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 ≤ 𝑚 + 1 (10)
From equation (9) and (10), we have
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 = 𝑚 + 1
CONCLUSION
Based on main results, we can conclude that:
Let 𝑚 and 𝑛 be two integers at least 3 and 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 be a star wheel graph, then
𝑚 + 1, 𝑚 ≥ 𝑛 𝑜𝑟 𝑚 < 𝑛, 𝑚 ≥ 4, 𝑛 = 𝑚 + 𝑘, 𝑘 ∈ [1, 𝑚 − 3]
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 = 𝑚 + 𝑎, 𝑚 < 𝑛, 𝑛 = 𝑎 𝑚 − 1 , 𝑎 𝑚 − 1 + 1 , 𝑎 ∈ [2, 𝑚]
2𝑚 + 1, 𝑜𝑡ℎ𝑒𝑟𝑠

Let 𝑚 and 𝑛 be two integers at least 3 and 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 be a star wheel graph, then

𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 =𝑚 + 1
REFERENCES
Diestel, R. (2010), Graph Theory, 4th edition, springer.
Krivelevich, M and Yuster, R. (2009), The rainbow connecton of a graph is (at most) reciprocal to
its minimum degree three. J. Graph Theory, 63 (3), 185-191.
Li, X and Liu, S. (2011), Rainbow vertex-connection number of 2-connected graphs.
Arxiv:1110.5770v1[math.CO]2011.
Simamora, D.N.S and Salman, A.N.M. (2015), The rainbow (vertex) connection number of pencil
graphs, Procedia 74, 138-142.
Bustan, A. W., & Salman, A. N. M. (2018). The Rainbow Vertex-Connection Number of Star Fan
Graphs. CAUCHY, 5(3), 112-116.

Vous aimerez peut-être aussi