Contemplating on Brush Numbers of Mycielski Jaco Graphs, $\mu(J_n(1)), n \in \Bbb N$

0.12 MB·English

by  Johan Kok

Contemplating on Brush Numbers of Mycielski Jaco Graphs,
µ(J (1)),n ∈ N
n
(Johan Kok, Susanth C, Sunny Joseph Kalayathankal)1
Abstract
5
1
0
2 Theconceptofthebrushnumberbr(G)wasintroducedforasimpleconnectedundirectedgraph
n G. The concept will be applied to the Mycielski Jaco graph µ(Jn(1)),n ∈ N, in respect of an
a optimal orientation of Jn(1) associated with br(Jn(1)).
J

7 Further to the above the concept of a brush centre of a simple connected graph will be in-
troduced. Because brushes themselves may be technology of kind, the technology in real worl

]
application will normally be the subject of maitenance or calibration or virus vetting or alike.
O
Finding a brush centre ofa graphwill allowfor well locatedmaintenance centres ofthe brushes
C
prior to a next cycle of cleaning.
.
h
t
a
m
Keywords: Brush number,Jaco graph, Mycielski Jaco graph, Brush centre
[

1 AMS Classification Numbers: 05C07, 05C12, 05C20, 05C38, 05C70
v
1
8
3
1 1 Introduction
0
.
1
0
5 For a general reference to notation and concepts of graph theory see [1]. For ease of self-
1
containess we shall briefly introduce the concepts of brush numbers and Mycielskian graphs.
:
v
i 1Affiliation of author:
X
Johan Kok (Tshwane Metropolitan Police Department),City of Tshwane, Republicof SouthAfrica
r e-mail: [email protected]
a
Susanth C (Department of Mathematics, Vidya Academy of Science and Technology), Thalakkottukara, Thrissur-
680501, Republicof India
e-mail: susanth [email protected]
Sunny Joseph Kalayathankal (Department of Mathematics, Kuriakose Elias College), Mannanam, Kottayam-
686561, Kerala, Republicof India
e-mail: [email protected]
1
1.1 The brush number of a simple connected graph G
The concept of the brush number b (G) of a simple connected graph G was introduced by
r
McKeil [5] and Messinger et. al. [7]. The problem is initially set that all edges of a simple
connected undirected graph G is dirty. A finite number of brushes, β (v) ≥ 0 is allocated
G
to each vertex v ∈ V(G). Sequentially any vertex which has β (v) ≥ d(v) brushes allocated
G
may clean the vertex v andsend exactly one brush along a dirty edge and in doing so allocate
an additional brush to the corresponding adjavent vertex (neighbour). The reduced graph
G′ = G−vu is considered for the next iterative cleaning step. Note that a
∀vu∈E(G),βG(v)≥d(v)
neighbour of vertex v in G say vertex u, now have βG′(u) = βG(u)+1.
Clearly for any simple connected undirected graph G the first step of cleaning can begin
if and only if at least one vertex v is allocated, β (v) = d(v) brushes. The minimum number
G
ofbrushes thatisrequired to allowthefirst stepof cleaning tobeginis, β (u) = d(u) = δ(G).
G
Note that these conditions do not guarantee that the graph will be cleaned. The conditions
merely assure at least the first step of cleaning.
If a simple connected graph G is orientated to become a directed graph, brushes may only
clean along an out-arc from a vertex. Cleaning may initiate from a vertex v if and only
if β (v) ≥ d+(v) and d−(v) = 0. The order in which vertices sequentially initiate cleaning
G
is called the cleaning sequence in respect of the orientation α . The minimum number of
i
brushes to be allocated to clean a graph for a given orientation α (G) is denoted bαi. If an
i r
orientation α renders cleaning of the graph undoable we define bαi = ∞. An orientation α
i r i
for which bαi is a minimum over all possible orientations is called optimal.
r
Now, since the graph G having ǫ(G) edges can have 2ǫ(G) orientations, the optimal ori-
entation is not necessary unique. Let the set A = {α | α an orientation of G}.
i i
Lemma 1.1. For a simple connected directed graph G, we have that:
br(G) = minover allαi∈A(Pv∈V(G)max{0,d+(v)−d−(v)}) = min∀αibαri.
Proof. See [9].
Although we mainly deal with simple connected graphs it is easy to see that for set of simple
n
connected graphs {G ,G ,G ,...,G } we have that, b (∪ G ) = Pb (G ).
1 2 3 n r ∀i i r i
i=1
2
1.2 Mycielskian graph µ(G) of a graph, G
Mycielski [8] introduced an interesting graph transformation in 1955. The transformation
can be described as follows:
(1) Consider any simple connected graph G on n ≥ 2 vertices labelled v ,v ,v ,...,v .
1 2 3 n
(2) Consider the extended vertex set V(G)∪{x ,x ,x ,...,x } and add the edges {v x ,v x |
1 2 3 n i j j i
iff v v ∈ E(G)}.
i j
(3) Add one more vertex w together with the edges {wx |∀i}.
i
The transformed graph (Mycielskian graph of G or Mycielski G) denoted µ(G), is the
simple connected graph with V(µ(G)) = V(G) ∪ {x ,x ,x ,...,x } ∪ {w} and E(µ(G)) =
1 2 3 n
E(G)∪{v x ,v x | iff v v ∈ E(G)}∪{wx |∀i}.
i j j i i j i
2 Brush Numbers of Mycielski Jaco Graphs, µ(J (1)),n ∈ N
n
The infinite Jaco graph (order 1) was introduced in [2], and defined by V(J (1)) = {v |i ∈
∞ i
N},E(J (1)) ⊆ {(v ,v )|i,j ∈ N,i < j}and(v ,v ) ∈ E(J (1))ifandonlyif2i−d−(v ) ≥ j.
∞ i j i j ∞ i
The graph has four fundamental properties which are; V(J (1)) = {v |i ∈ N} and, if v
∞ i j
is the head of an edge (arc) then the tail is always a vertex v ,i < j and, if v , for smallest
i k
k ∈ N is a tail vertex then all vertices v ,k < ℓ < j are tails of arcs to v and finally, the
ℓ j
degree of vertex k is d(v ) = k. The family of finite directed graphs are those limited to
k
n ∈ N vertices by lobbing off all vertices (and edges arcing to vertices) v ,t > n. Hence,
t
trivially we have d(v ) ≤ i for i ∈ N.
i
For ease of reference we repeat a few definitions found in [2].
Definition 2.1. The infinite Jaco Graph J (1) is defined by V(J (1)) = {v |i ∈ N},
∞ ∞ i
E(J (1)) ⊆ {(v ,v )|i,j ∈ N,i < j} and (v ,v ) ∈ E(J (1)) if and only if 2i−d−(v ) ≥ j.
∞ i j i j ∞ i
Definition 2.2. The family of finite Jaco Graphs are defined by {J (1) ⊆ J (1)|n ∈ N}. A
n ∞
member of the family is referred to as the Jaco Graph, J (1).
n
Definition 2.3. The set of vertices attaining degree ∆(J (1)) is called the Jaconian vertices
n
of the Jaco Graph J (1), and denoted, J(J (1)) or, J (1) for brevity.
n n n
3
Definition 2.4. The lowest numbered (indiced) Jaconian vertex is called the prime Jaconian
vertex of a Jaco Graph.
Definition 2.5. If v is the prime Jaconian vertex of a Jaco Graph J (1), the complete sub-
i n
graph on vertices v ,v ,··· ,v is called the Hope subgraph of a Jaco Graph and denoted,
i+1 i+2 n
H(J (1)) or, H (1) for brevity.
n n
Note that the Fisher Algorithm determines d+(v ) on the assumption that the Jaco Graph
i
is always sufficiently large, so at least J (1),n ≥ i+d+(v ). So technically the value d+(v )
n i i
determined by the Fisher Algorithm is, d+(v ) = d+ (v ). For a smaller graph the degree
i J∞ i
of vertex v is given by d (v ) = d−(v ) + (n −i). In [2] Bettina’s theorem describes an
i Jn(1) i i
arguably, closed formula to determine d+(v ). Since d−(v ) = n − d+(v ) it is then easy
i i i
to determine d (v ) in a smaller graph J (1),n < i + d+(v ). It is important to note
Jn(1) i n i
that Definition 2.2 read together with Definition 2.1, prescribes a well-defined orientation
of the underlying Jaco graph. So we have one defined orientation of the 2ǫ(Jn(1)) possible
orientations. In [4] the following theorem is proven.
Theorem 2.1. For the finite Jaco Graph J (1),n ∈ N, with prime Jaconian vertex v we
n i
have that:
i n
b (J (1)) = P(d+(v )−d−(v ))+ P max{0,(n−j)−d−(v )}.
r n j j j
j=1 j=i+1
In general we have that if βG′(v) at a particular cleaning step has βG′(v) > dG′(v), exactly
βG′(v)− dG′(v) brushes are left redundant and can clean along new edges linked to vertex
v if such are added through transformation of the graph G. The latter observation allows
for an adaption of Theorem 2.1 to obtain the brush number of µ(J (1))n ≥ 3. Note that
n
µ(J (1)) ≃ K ∪ P , hence a disconnected graph. Easy to see that µ(J (1)) ≃ C hence
1 1 2 2 5
b (µ(J (1)) = 2.
r 2
Theorem 2.2. For the Jaco graph J (1),n ∈ N,n ≥ 2 the brush number of the Mycielski
n
Jaco graph is given by:
n
b (µ(J (1)) = 2Pd+ (v ).
r n Jn(1) i
i=1
Proof. Consider the Jaco graph, J (1). From [4] it follows that b (J (1)) = 1 with brush
3 r 3
allocations β (v ) = 1,β (v ) = 0,β = 0. In the graph µ(J (1)) we add the set of
J3(1) 1 J3(1) 2 J3(1) 3
vertices {x ,x ,x }∪{w} and we add the edges {v x ,v x ,v x ,v x }∪{wx ,wx ,wx }.
1 2 3 1 2 2 1 2 3 3 2 1 2 3
4
Clearly v has degree, d (v ) = 2. So besides the normal cleaning sequence within
1 µ(J3(1)) 1
J (1), vertex v must either dispatch a second brush along edge v x or await a brush dis-
3 1 1 2
patched from vertex x . In the latter case a brush will be left redundant at vertex v . So
2 1
without loss of generality and to ensure optimality, allocate a second brush to v . At this
1
stage we have the first brush number term of µ(J (1)), 2d+ (v ) = 2.
3 J3(1) 1
On initiating the cleaning process one brush will be dispatched to v along the arc (v ,v )
2 1 2
(edge v v ). In the next step of cleaning the brush from vertex v now at v can be dis-
1 2 1 2
patched to v provided that two more brushes are initially allocated to v to begin with.
3 2
But in µ(J (1)) we have the additional edges v x ,v x , so two additional brushes must be
3 2 1 2 3
allocated to vertex v . So we have the second brush number term of µ(J (1)), 2d+ (v ) = 2.
2 3 J3(1) 2
In the second step of cleaning the brush, initially dispatched from v to v can be dis-
1 2
patched to vertex v . The third step of cleaning may proceed with no further allocation to
3
v . Hence v requires zero additional brushes. Now we have the third and final brush number
3 3
term of µ(J (1)), 2d+ (v ) = 0. Hence we have the result:
3 J3(1) 3
3
b (µ(J (1))) = 2Pd+ (v ).
r 3 J3(1) i
i=2
We settled the result through induction. Assume the the result holds for J (1), with prime
k
Joconian vertex v . Thus we assume that:
j
k
b (µ(J (1))) = 2Pd+ (v ), holds.
r k Jk(1) i
i=2
Now consider the Jaco graph J (1) to begin with. This extension adds the vertex v and
k+1 k+1
theset ofarcs, {(v ,v ),(v ,v ),(v ,v ),...,(v ,v )}toJ (1)toobtainJ (1).
i+1 k+1 i+2 k+1 i+3 k+1 n k+1 k k+1
Each vertex v ,i+1 ≤ j ≤ k receives two additional arcs namely (v ,v ) and (v ,x ) in
j j k+1 j k+1
the transformed Mycielski Jaco graph. The minimum additional brushes per such vertex is
thus two. We have that the respective brush number terms of µ(J (1)) are (d+ (v )+2) =
k+1 Jk j
2d+ (v ). This implies we have the partial brush number:
Jk+1(1) j
k
2Pd+ (v ).
Jk+1(1) i
i=1
With regards to the vertex v we have, d (v ) = d−(v ) stemming from the
k+1 Jk+1(1) k+1 k+1
k − j vertices, v ,v ,v ,...,v . Hence, k − i brushes will be allocated to vertex v
j+1 j+2 j+3 k k+1
through the iterative cleaning process. In the Mycielski Jaco graph the additional edges
5
v x ,v x ,v x ,...,v x , (exactly k − j edges) have been added to vertex
k+1 k k+1 k−1 k+1 k−2 k+1 j+1
v so no additional brushes are needed. It means that the final brush number term is,
k+1
2d+ (v ) = 2.0 = 0. Since all the brush number terms of µ(J (1)) have now been
Jk+1(1) k+1 k+1
k+1
determined at the absolute minimum we have the result, b (µ(J (1)) = 2 P d+(v ).
r k+1 i
i=1
Through induction we settle the result that:
n
b (µ(J (1)) = 2Pd+ (v ),∀J (1),n ∈ N,n ≥ 3.
r n Jn(1) i n
i=1
3 Brush Centre of a Graph
From Theorem 2.1 and Lemma 1.1 the brush allocations can easily be determined for Jaco
graphs. See [4]. For example, J (1) requires the minimum brush allocations, β (v ) =
9 J9(1) 1
1,β (v ) = 0,β (v ) = 1,β (v ) = 2,β (v ) = 1,β (v ) = 1,β (v ) =
J9(1) 2 J9(1) 3 J9(1) 4 J9(1) 5 J9(1) 6 J9(1) 7
0,β (v ) = 0,β (v ) = 0. We note that the allocations of β(v ) > 0 are located at
J9(1) 8 J9(1) 9 i
vertices v ,v ,v ,v ,v . The end allocation itself is a minimum allocation associated with
1 3 4 5 6
an optimal orientation.
So far cleaning was restricted to a brush transversing a dirty edge only once. If the latter
restriction is relaxed to, after the first complete cleaning sequence a brush may transverse an
edge for a second time for another complete reversed cleaning sequence, the initial allocation
of brushes or a deviation thereof can be obtained.This observation leads to the concept of a
brush centre. The question is, what is the minimium set of vertices, B (G) ⊆ V(G) (primary
r
condition) to allocate the b (G) brushes to, to ensure cleaning of graph G and on return
r
(second cleaning) the brushes are clustered as centrally as possible for maintenance (sec-
ondary condition is the min(max(distance between vertices of the brush centre))). Finding a
brush centre of a graph will allow for well located maintenance centres of the brushes prior
to a next cycle of cleaning. Because brushes themselves may be technology of kind, the
technology in real worl application will normally be the subject of maitenance or calibration
or virus vetting or alike.
It is easy to see that for the path P the allocation of one brush to either {v } or {v }
n 1 n
is a minimum set and clustered absolutely centrally so both represent a brush centre. So
P has two possible brush centres. Similarly, the allocation of two brushes to any set
n
B (C ) = {v },v ∈ V(C ) of the cycle cycle C represents a brush centre. So C has n
r n i i n n n
6
possible brush centres. Hence the brush centre of a graph G is not necessary unique. How-
ever, for the star K the brush centre is indeed unique, namely, B (K ) = {v } ,
1,n r 1,n 1 (v1 central)
with β (v ) = n.
K1,n 1 (v1 central)
3.1 Brush centre of the Mycielski Jaco Graph, µ(J (1)),n ∈ N
n
Let us immediately jump paths and consider J (1). In the defined Jaco graph J (1) the
5 5
brush number is b (J (1)) = 2 [4], with the brush allocation β (v ) = 1,β (v ) =
r 5 J5(1) 1 J5(1) 2
0,β (v ) = 1,β (v ) = 0,β (v ) = 0. We note that after the first cleaning sequence
J5(1) 3 J5(1) 4 J5(1) 5
both brushes are allocated to the vertex v . The latter allocation of brushes with an appro-
5
priate re-orientation of J (1) also clean the Jaco graph. On a second cleaning sequence the
5
brushes can park at v for maintenance. Clearly the set {v } with β (v ) = 2 is a (the)
5 5 J5(1) 5
brush centre.
Theorem 3.1. Consider the initial minimal brush allocation of b (J (1)) brushes to the
r n
finite Jaco graph, J (1),n ∈ N, [4]. The location of the brushes at the end of the cleaning
n
sequence represents a brush centre of J (1),n ∈ N.
n
Proof. For the paths J (1),J (1),J (1),J (1) the result is obvious. As observed in the intro-
1 2 3 4
duction the set B (J (1)) = {v } with β (v ) = 2 is a (the) brush centre of J (1).
r 5 5 J5(1) 5 5
We prove the result through induction. Assume the result holds for J (1) which has the
k
prime Jaconian vertex v . So our assumption implies that after the first cleaning sequence
i
the brushes are clustered amongst vertices in the vertex set B ⊆ {v ,,v ,v ,..,v }
r i+1 i+2 i+3 k
in compliance with both the primary condition and the secondary condition namely, the
min(max(distancebetweenverticesofthebrushcentre)). Notethatmin(max(d (v,u))) =
v,u∈Br
1 because B (J (1)) ⊆ H(J (1)).
r k k
Now consider the Jaco graph J (1) to begin with. This extension adds the vertex v
k+1 k+1
and the set of edges, {v v ,v v ,v v ,...,v v } to J (1) to obtain J (1).
j+1 k+1 j+2 k+1 j+3 k+1 n k+1 k k+1
Each vertex v ,i+1 ≤ j ≤ k receives one additional edges namely v v . In addition the
j j k+1
prime Jaconian vertex may, or may not change to v . Exactly k−i new edges were added
i+1
in the extension from J (1)) to J (1). Since b (J (1)) ≥ b (J (1)) additional brushes
k k+1 r k+1 r k
might be needed at some of the vertices v ,v ,...,v if v remains theprime Jaconianver-
i+1 i+2 k1 i
tex of J (1). Else, additional brushes might be needed at some of the vertices v ,...,v .
k+1 i+2 k1
Note that the vertex v will not require additional brushes. Since the minimum additional
k
7
brushes to be allocated is always possible (primary condition) and B (J (1)) ⊆ H(J )
r k+1 k+1
the min(max(d (v,u))) = 1 (secondary condition), the result follows for J (1).
v,u∈Br(Jk+1(1)) k+1
Hence the result is settled for all Jaco graphs, J (1),n ∈ N.
n
Open access: This paper is distributed under the terms of the Creative Commons
Attribution License which permits any use, distribution and reproduction in any medium,
provided the original author(s) and the source are credited.
References (Limited)
[1] Bondy, J.A., Murty, U.S.R., Graph Theory with Applications, Macmillan Press, Lon-
don, (1976).
[2] Kok, J., Fisher, P., Wilkens, B., Mabula, M., Mukungunugwa, V., Characteristics of
Finite Jaco Graphs, J (1),n ∈ N, arXiv: 1404.0484v1 [math.CO], 2 April 2014.
n
[3] Kok, J., Fisher, P., Wilkens, B., Mabula, M., Mukungunugwa, V., Characteristics of Jaco
Graphs, J (a),a ∈ N, arXiv: 1404.1714v1 [math.CO], 7 April 2014.
∞
[4] Kok, J., A note on the Brush Number of Jaco Graphs, J (1),n ∈ N, arXiv: 1412.5733v1
n
[math.CO], 18 December 2014.
[5] McKeil, S., Chip firing cleaning process, M.Sc. Thesis, Dalhousie University, (2007).
[6] Messinger, M. E., Methods of decontaminating a network, Ph.D. Thesis, Dalhousie Uni-
versity, (2008).
[7] Messinger, M.E., Nowakowski, R.J., Pralat, P., Cleaning a network with brushes. Theo-
retical Computer Science, Vol 399, (2008), 191-205.
[8] Mycielski, J., Sur le coloriages des graphes, Colloq. Maths. Vol 3, (1955), 161-162.
[9] Ta Sheng Tan,The Brush Number of the Two-Dimensional Torus, arXiv: 1012.4634v1
[math.CO], 21 December 2010.
8