A STUDY ON CORE IN ROUGH GRAPH AND WEIGHTED

GRAPH
The project work submitted to
BHARATHIDASAN UNIVERSITY, TIRUCHIRAPPALLI
In partial fulfillment of the requirements for the award of the degree of

MASTER OF SCIENCE
IN
MATHEMATICS

Submitted by
P. YOGAYALINI
(Reg. No: P 21192643)

Under the guidance of

Mr. J. EUGINE, D. T. Ed., M.Sc., M.A., B.Ed., M. Phil

DEPARTMENT OF MATHEMATICS
BHARATH COLLEGE OF SCIENCE AND MANAGEMENT
(Affiliated to Bharathidasan University)
THANJAVUR
APRIL 2023
 CERTIFICATE

Mr. J. EUGINE, D. T. Ed., M.Sc., M.A., B.Ed., M. Phil

Assistant Professor of Mathematics,
Bharath College of Science and Management,
Thanjavur – 5.

CERTIFICATE

This is to certify that the project work entitled “CORE IN ROUGH

GRAPH AND WEIGHTED GRAPH” is a Bonafide work done by P.
YOGAYALINI (Reg. No: P 21192643) under my guidance during the academic
year 2022-2023.

Signature of the Guide Signature of the HOD

Viva – Voce Examination held on ______________ at Bharath College of Science and

Management, Thanjavur – 5.

Signature of the External Examiner

ACKNOWLEDGEMENT

ACKNOWLEDGEMENT
 I thank the Lord Almighty for showering his grace and blessings to complete this project

successfully.

I express my sincere thanks to The Management, The Director and Our Principal,

Bharath college of Science and Management for providing this golden opportunity to complete

my project with Lots of Facilities

My special thanks to Mr. J. EUGINE, D. T. Ed., M.Sc., M.A., B.Ed., M. Phil,

Department of Mathematics for his support and encouragement.

I express my deep sense of gratitude and heartfelt to my guide

Mr. J. EUGINE, D. T. Ed., M.Sc., M.A., B.Ed., M. Phil for his invaluable guidance and

continuous support in completing my project work. His guidance has helped me to write this

project.

I extend my special and deepest thanks to my friends and I am eternally grateful to my

beloved parents for their car and love for me. I would like to express my sincere thanks to all

my staff members and my friends who prayed all time for my success. Finally, I express my

thanks to all who helped me to complete my project effectively.

P. YOGAYALINI

(Reg. No: P 21192643)

CONTENT
 CONTENT

CHAPTER TITLE PAGE NO.

INTRODUCTION

CHAPTER - 1 BASIC DEFINITIONS

CHAPTER -2 CORE IN ROUGH GRAPH

CHAPTER - 3 CORE WEIGHTED ROUGH GRAPH

CHAPTER - 4 APPLICATIONS

CONCLUSION

BIBLIOGRAPHY
INTRODUCTION
 INTRODUCTION

Rough set theory, proposed by Zdzislaw Pawlak (1982), models uncertainty by

equivalence relations. The primary notion is the partitioning of the domain into equivalence
classes. Objects belonging to the same equivalence cannot be distinguished. Hence Rough set
theory is a theory of multiple memberships.

A graph is a convenient way of representing information involving relationships between

objects. The objects are represented by vertices and relations by edges. When there is vagueness
in the description of the objects or in their relationships or in both, it is natural that we need to
design a “Rough graph model”.

An attribute set was first assigned to the edges of a graph. Given a subset R of the
attribute set, there is associated an equivalence relation, based in which R-rough is defined. If the
vertices of a graph are connected through edges denoting different possible relationship.

In this paper the core is taken up the central structure of a rough graph & weighted rough
graph. The core of graph G is a path of minimum distance. Minieka & Patel have investigated
the problem of finding a tree core with a specified length. Eliezer. A, Albacea has presented a
parallel algorithm for finding the core of the tree with weights only on edges.

In a particular application, villages may be considered vertices and roads as edges. In

such cases the population of a village will then be the rough weight of the vertex, the bus route,
which goes adjacent to the villages may be treated as central structure now the people of several
villages have to reach the bus route traversing the lowest possible distance.

In this edge & vertex weighted rough graph, it is proposed to design & develop to find
the central structures like radius, diameter, center and core.
Chapter 1
 BASIC DEFINITION
DEFINITION 1.1

ROUGH SET

A Rough Set is a formal approximation of a crisp-set in terms of a pair of sets which the
lower and upper approximation of the original set.

Let U denote the set of objects called Universe and let R be an equivalence relation on
U . The pairs A=(U , R) is called an Approximation Space. For u , v ∈U , u and belong to the
same equivalence class and we say that they are indistinguishable in A . The relation R is called
an Indiscernibility Relation.

Let [ X ] R denote an equivalence class of R containing element x , then lower & upper
approximation for a subset X ⊆U in A denoted by A ( X ) ∧A ( X )respectively,

Where A ( X ) ={ x ∈ U / [ X ] R ⊂ X }

A ( X ) ={ x ∈ U / [ X ] R ∩ X ≠ ∅ } Thus, if an object x ∈ A ( X ) then “ x surely belongs to X in A ”

If x ∈ A ( X ) then “ x possibly belong to X in A ”.

DEFINITION:1.2

MEMBERSHIP VALUE

| A ( X )|
The membership value of X is μ ( X )=
| A ( X )|
¿( [ X ] R ∩ X )
The membership value of each element of X in A is μ X ( x )=
¿ [ X ]R
RESULTS:1.1

1. If A ( X ) = A ( X ) then X is definable on attribute set A .

2. If A ( X ) ≠ A ( X ) then X is undefinable (roughly definable) on attribute set A .

i. If A ( X ) ≠ ∅∧ A ( X ) ≠U then X is undefinable (R- roughly definable) on attribute set A .

ii. If A ( X ) ≠ ∅∧ A ( X ) =¿U then X is internally undefinable ( Ri) on attribute set A .
iii. If A ( X ) =∅∧ A ( X ) ≠ U then X is externally undefinable ( Re ) on attribute set A .
iv. If A ( X ) =∅∧ A ( X ) =U then X is totally undefinable ( Rt ) on attribute set A .

DEFINITION:1.3

CRISP GRAPH

A Rough graph is a pair R ( G )=¿ where R ( G ) :(V , E) is a crisp graph and R ( G ) :(V , E)
is a fuzzy graph and R ( G ) ⊆ R (G)

A weighted rough graph is of the form G :(R , R ,V , σ , μ) Where 𝜇 is a fuzzy subset of a

nonempty set 𝐸 & 𝜎 is a fuzzy relation on 𝜇.

Define μ1 :R → ( 0,1 ) , μ 2 : R →1∧¿

σ (u)≥ max ⁡{ μ ( u , ui ) /u∧ui are adjacent , where 1 ≤i ≤ n }.

DEFINITION:1.4

COMPLEMENT OF A WEIGHTED ROUGH GRAPH

The complement of a weighted rough graph G: ( R , R, V, 𝜎, 𝜇) is Gˈ:(𝑅 ˈ, 𝑅 ˈ Vˈ, 𝜎 ˈ,

𝜇ˈ) where,

(i) Vˈ = V
(ii) 𝜇ˈ =1- 𝜇
 (iii) 𝜎 ˈ(𝑢) ≥ {max {𝜇ˈ (𝑢,ui ) / 𝑢 and 𝑢𝑖 are adjacent where ui ∈ V}.

DEFINITION:1.5

DEGREE

Let G be a weighted rough graph. The Degree of an edge e=uv is d R (G ) ( uv )=¿𝜎(u)+𝜎( v

). Minimum degree of G is 𝛿( 𝐺)= ∧{𝑑(𝑢𝑣)/𝑢𝑣 ∈ 𝐸}. Maximum degree of G is △ (𝐺)=
∨{𝑑(𝑢𝑣)/𝑢𝑣 ∈ 𝐸}. Let G be a weighted rough graph. The degree of an vertex ‘𝑣’ is defined by
d ( R ( G) )u ≠ v ( v )=∑ μ(u , v)

DEFINITION: 1.6

K- REGULAR WEIGHTED EDGE ROUGH GRAPH.

Let 𝑅(G) :(𝜎, 𝜇) be a rough graph. If d R (G ) ( e )=k for all e ∈ 𝐸, then 𝑅G) is said to be an
regular weighted edge rough graph of degree k or a k- regular weighted edge rough graph.

REMARK:

(𝑅(G)) is a k-edge regular weighted rough graph if and only if 𝛿=△=k.

DEFINITION:1.7

WEIGHTED ROUGH GRAPH

A weighted rough graph is strong if 𝜎(𝑢) = max {𝜇 ( 𝑢, ui ) / 𝑢 and ui are adjacent,

where 1 ≤ i ≤ n}.
DEFINITION:1.8

COMPLETE

A weighted rough graph is complete if 𝜎(𝑢) = max {𝜇 (𝑢, ui ) / 𝑢 and ui are adjacent, ⩝ 𝑖
= 1,2 … 𝑛} 𝑢, u1 u2,…, un ∈ σ* and every Adjacent Edges 𝑢u1, 𝑢u2,…,𝑢un ∈ μ* where G:( σ*,
μ*) is a crisp graph.

DEFINITION:1.9

LENGTH & STRENGTH

A path P of length n is a sequence of distinct nodes u0 u1 , … ,u n s.t 𝜇 (ui−1, ui )>0, i =1,2…

n & the degree of membership of a weakest edge is defined as its strength. The strength of
connectedness between two nodes u & v is defined as the maximum of the strength of all path
between u & v.

DEFINITION:1.10

CONNECTED ROUGH GRAPH

Let R ( G )=¿ be a connected rough graph. If there is at most one strongest path between
any two nodes of R(G), then R(G) is a rough graph tree.
CHAPTER 2
 CORE IN ROUGH GRAPH

DEFINITION:2.1

R-ROUGH GRAPH

Let U= (V, E) be the universal graph. Where V= { v1 , v 2 , v 3 , … , v n} is the set of vertices &
E= {e 1 ,e 2 , e3…e n } is the set edges on U where the edge e K is endued with vertex attribute ( vi , v j
). Let R = {r 1 r 2 r 3 … r|R|} be the attribute set on U. For any attribute set R⊆R on E, the elements
of E can be divided into different equivalence classes [e]R .

For any graph T= (W, X), where W⊆V and X⊆ E, If X is the sum of equivalence
classes, then the graph is called R-definable graph or R-exact graph. If not, the graph is called R-
un definable graph or R-rough graph. For R-rough graph, two exact graphs,

R ( T )=( W , R ( X ) )∧R ( T )=( W , R ( X ) ) can be used to define it approximately. Where

R ( X ) ={e ∈ E/ [ e ]R ⊂ X }

R ( X ) ={e ∈ E/ [ e ]R∩ X ≠ ∅ }. The graph R(T ) & R(T ) are called R-lower and R-upper
approximation of graph T. The pair of Graph ( R ( T ) , R(T )) is called R-rough graph.

RESULTS:2.1

1. The graph T =(𝑅(T), 𝑅(T)) is exact if and only if (𝑅(T)= 𝑅(T)).

2. The graph T =(𝑅(T), 𝑅(T)) is called a rough graph if and only if (𝑅(T)≠ 𝑅(T).
3. The graph T =(𝑅(T), 𝑅(T)) is a classical graph if and only if all the edges of T belong to
the same equivalence class with respect to R.

EXAMPLE:1
 Let us consider the graph G= (W, X) where W⊆V and X⊆ E

W= { v1 , v 2 , v 3 , v 4 , v 5 , v 6 , v7 , v 8 , v 9 }and

E= {e 1 ,e 2 , e3 , e 4 ,e 5 , e6 , e 7 , e 8 , e9 , e 10}.

e1 e2

e3
e4 e5 e6

e7
e8
e9
e 10

Figure 2.1

Let X= {e 1 ,e 3 , e4 , e 6 , e10}. Let R be the equivalence relation, here R=edge coloring.

The equivalence classes are {{𝑔, 𝑔, 𝑔}, {𝑟, 𝑟}, {𝑦, 𝑦, 𝑦}, {𝑏, 𝑏}}

E= {{𝑒1, 𝑒6, 𝑒10}, {𝑒2, 𝑒3}, {𝑒4, 𝑒5, 𝑒9}, {𝑒7, 𝑒8}}

R-Lower & R-Upper approximation of graph G are R ( G )∧R(G) can be used to define it
approximately.

where 𝑅(X)= {e ∈ E/[ e ] R⊂ X}

= {e 1 ,e 6 , e10 }

𝑅(X)= {e ∈ E/[ e ] R ⋂ X≠ 𝜙}

= {e 1 ,e 2 , e3 , e 4 ,e 5 , e6 , e 9 , e 10}

¿ ([e 1] ¿ ¿ R ∩ X)
The membership values are μ X ( e1 ) = ¿
¿¿¿¿
 μ X ( e6 ) =μ X ( e 10 )=1

1
μ X ( e2 ) =μ X ( e 3 )=
2

1
μ X ( e4 )=μ X ( e5 ) =μ X ( e9 ) =
3

RESULTS:2.2

(i) R( X) ⊂ X ⊆ R(X )
(ii) R(∅)⊂ ∅ ⊆ R( ∅)
(iii) R(U ) ⊂U ⊆ R (U)
(iv) R ( X ∩Y )=R ( X )∩ R ( Y )
(v) R ( X ∪ Y )=R( X )∪ R(Y )
(vi) X ⊆Y ⇒ R ( X ) ⊆R ( Y )∧R(X )⊆ R (Y )
(vii) R( X ∪ Y ) ⊇R (X )∪ R (Y )
(viii) R( X ∩Y ) ⊆ R(X ) ∩ R(Y )
(ix) R ( R ( X ) ) =R ( R ( X ) )=R ( X )
(x) R ( R ( X ) ) =R ( R ( X ) )=R (X )

2.1 ROUGH -SPANNING SUB GRAPH

THEOREM:2.1

Let G be a complete graph with n ≥ 2 vertices then

(i) Number of definable spanning sub graph under minimum edge coloring is

n ( d ( K n ) )= {2n ,if n isodd

2n+1 , if nis even }
(ii) Number of undefinable (rough) spanning sub graph under minimum edge coloring is

{ }
n(n−1)
2 2
−2n , if n is odd
n ( R ( K n) )= n (n−1)
n−1
2 2
−2 , if n is even

THEOREM:2.2

Let G be a cycle with n ≥ 3 vertices then

(i) Number of definable spanning sub graph under minimum edge coloring is

{ }
3
2 , if n is odd
n ( d ( K n ) )= 2
2 ,if niseven

(ii) Number of undefinable (rough) spanning sub graph under minimum edge coloring is

{ }
n 3
2 −2 ,if n is odd
n ( R ( C n ))=
2 n−22 ,if n is even

THEOREM:2.3

Let G(V , E) be any graph. If the number of edges is equal to the number the equivalence
classes under attribute R then all the spanning sub graph of the given graph is definable under the
attribute R.

EXAMPLE:2

(i) In K 3: All the edge sub graph of K 3 are definable under minimum edge coloring
n ( d ( K 4 ) ) =2
3

(ii) In K 4 : n (d ( K 4 )) = 23, n (R ( K 4 )) = 12, n ( Ri ( K 4 )) = 18, n ( Re ( K 4 )) = 18 n ( Rt ( K 4

)) =8.
 (iii) In K 5: n (d ( K 4 )) = 25, n (R ( K 4 )) =620, n (𝑅𝑖 ( K 4 )) =170, n (𝑅𝑒 ( K 4 )) =172, n (𝑅𝑡 (
K 4 )) =30.
(iv) In C4: n (d (C4)) = 22, n (R (C4)) =0, n ( Ri(C4)) =4, n (𝑅e (C4)) =4 n (𝑅t
(C4)) =4.
(v) In C5: n (d (C5)) =23, n (R (C5)) =8, n ( Ri (C5)) =8 n (𝑅e (C5)) =8 n ( 𝑅t
(C5)) =0.

2.2 DISTANCE IN ROUGH GRAPH

DEFINITION:2.2

ECCENTRICITY

Eccentricity of a vertex v, denoted by 𝑒R(v) is the distance from v to a vertex farthest

from it
e R ( v )=max { d R ( u , v ) :u ∈ V } , d R ( u , v )=∧ p {l p × s p where p is a ( u , v ) path ,l p−length of the path∧s p−strength of a p

DIAMETER

Diameter is the maximum eccentricity & radius is the minimum eccentricity. Each
vertex in V at which the eccentricity function is minimized is called a center. A vertex v is
called peripheral vertex if e R ( v )=diam(R ( G ) ). Average distance is defined by A(R(G)) =
1
nc
∑ d R (u , v ) . Each vertex in V at which the distance function is minimized is called a median
2

of R(G). The path of minimum distance is called a core (or) path median of R(G).

THEOREM:2.4

In a rough graph R(G), d R :V × V → [ 0,1 ] is a metric on V , ∀ u , v , w ∈ V

(i) 𝑑R (𝑢, 𝑣) ≥ 0 ⩝ (u , v ) ∈ V
 (ii) 𝑑R (𝑢, 𝑣) = 0 𝑖𝑓𝑓 u=v
(iii) 𝑑R (𝑢, 𝑣) = 𝑑R (𝑣, 𝑢)
(iv) 𝑑R (𝑢, 𝑤) ≤ 𝑑R (𝑢, 𝑣) + 𝑑R (𝑣, 𝑤).

THEOREM:2.5

Let R(G)= ( R ( G ) , R(G)) be a complete rough graph then diam ( K n) ≤ 1& rad ( K n ) <
1.

THEOREM:2.6

Let R(G)= ( R ( G ) , R(G)) be a complete bipartite rough graph then diam ( K m , n)

≤ 2 & rad ( K m , n)<2.

THEOREM:2.7

Let R(G)= ( R ( G ) , R( G)) be a path on n vertices then

n
diam ( Pn ) =∑ μ(u1 , ui)
i=1

n
rad ( Pn ) ≤ ∑ μ(u1 ,u i)
i=1

THEOREM:2.8

Let R(G)= ( R ( G ) , R( G)) be a complete rough graph & rad(R(G) =1 then R(G) is a self-
centered graph.
 2.3 FIND THE CORE OF THE GIVEN ROUGH GRAPH TREE

Finding the core of the given tree consists of the following four steps.

1. Find the end point for the given tree; call it e1.

2. Re-root the tree at e1.

3. Find the end point of the new tree; call it e2.

4. The path from e1 to e2 forms the core of the tree.

These steps are explained in detail with the help of an example. Finding the endpoint of a
core includes the following four steps.

(i) For each vertex v ∈ V , compute the size (number of nodes) of the sub tree rooted at v ,
size ( v).
(ii) For each vertex v ∈ V, compute reduction (r , v ).
(iii) Compute max r =max {reduction (r , v ); v ∈ V .
(iv) The end point is the vertex v with reduction (r , v )= max r

1
0.5 1

2
0.7 3
0.6 0.3
0.7
4
5 6
7
1
0.5
8
9
Figure 2.2
Step 1: find the end point of the given tree

(i) Compute size (v)

V 1 2 3 4 5 6 7 8 9

Size 9 4 4 2 1 2 1 1 1
(ii) Compute reduction (r , v ¿where r =1.

Reduction:

( r , u2 )=.5× 4=2 ,

( r , u3 ) =1× 4=4 ,

( r , u4 )=2 ×.7+ 4 ×.5=3.4 ,

( r , u5 ) =1× .6+.5 ×4=2.6

( r , u6 ) =2× .3+4 × 1=4.6

( r , u7 ) =1× .2+ 4 × 1=4.7

( r , u8 ) =1× 1+ 2× .7+.5 ×4=4.4

( r , u9 ) =1× .5+2× .3+1× 4=5.1

(iii) Since the highest reduction is 5.1, the corresponding vertex 9 is the end point, e 1=9
 Step 2: Re – root the tree e 1

9
0.5

6
0.3

3
1
0.7
1
0.5 7

2
0.7
0.6

4
5
1
Figure 2.3
8

Step 3: find the end point of the re – rooted tree.

(i) Compute size (v)

 V 1 2 3 4 5 6 7 8 9

Size 5 4 7 2 1 8 1 1 9

(ii) Compute reduction (r , v ¿where r =9.

Reduction:

( r , u6 ) =4 ,

( r , u3 ) =4+ 2.1=6.1 ,

( r , u7 ) =6.1+0.7=6.8 ,

( r , u1 )=6.1+ 5=11.1 ,

( r , u2 )=13.1 ,

( r , u4 )=13.7

( r , u5 ) =14.1

( r , u8 ) =15.5

(iii) Since the highest reduction is 15.5, the corresponding vertex 8 is the end point e 2=8
Step 4: the path e 1to e 2 forms the core of the tree

1
0.5 1

2
0.7 3
0.6 0.3
0.7
4
5 6
7
1 0.5

8
9

Figure 2.4
CHAPTER 3
 CORE WEIGHTED ROUGH GRAPH

3.1 DISTANCE IN WEIGHTED ROUGH GRAPH

DEFINITION 3.1

Eccentricity of a vertex v, denoted by e wR ( v ) is the distance from v to a vertex farthest

from it e wR ( v )=max { d wR ( u , v ) : u∈ V } , d wR ( u , v ) =d R ( u , v ) ×σ ( v ) ∀ u , v ∈V where d R ( u , v) is

distance in rough graph diameter is the maximum eccentricity & radius is the minimum
eccentricity .Each vertex in V at which the eccentricity function is minimized is called a center
of R(G).A vertex v is called peripheral vertex if e(v)=diam(R(G).

1
Average distance is defined by A ( R ( G ) )= n ∑ d wR ( u , v )
c2

Each vertex in V at which the distance function is minimized is called a median. The
path of minimum distance is called a w-core (or) path median.

THEOREM 3.1:

For any weighted rough graph G, the radius and diameter satisfy rad(G)≤diam(G)≤
2rad(G).

THEOREM 3.2
 Let G be a weighted rough graph, center of graph need not be same as the center of its
underlying graph.

THEOREM 3.3

For any two adjacent vertices u , v in a weighted rough graph |e wR (u )−e wR ( v )|≤ 1

THEOREM 3.4

For any two vertices u , v in a weighted rough graph |e wR (u )−e wR ( v )|≤ d wR ( u , v )

REMARK 3.1

In ordinary trees, the center is K 1 (or) K 2, but in weighted rough graph trees, the center
need not be K 1 (or) K 2.

c e

d f
g
Figure 3.1

Center of a tree in crisp graph

 a

0.4

0.2 b 0.1

c e
0.1
0.1
1
d f
g
Figure 3.2

Center of a tree in rough graph

0.4

0.4

0.4
0.2 0.1

0.2 1
0.1 0.1
1
0.1 0.1
1
Figure 3.3
 Center of a tree in weighted rough graph

REMARK 3.2

The center of a rough graph and a weighted rough graph are need not be same.

In fig 3.2, the central vertices of a rough graph are a, b, c, d &f. But in fig 3.3, the cental
vertices of a weighted rough are b &f.

THEOREM 3.5

A rough graph which is self-centered need not be a self-centered weighted rough graph.

3.2 FIND THE CORE OF THE GIVEN WEIGHTED ROUGH

GRAPH TREE
Finding the core of the given tree consists of the following four steps.

1. Find the end point for the given tree; call it e 1.

2. Re-root the tree at e 1.

3. Find the end point of the new tree; call it e 2.

4. The path from e 1 to e 2 forms the w - core of the tree.

These steps are explained in detail with the help of an example. Finding the end
point of a core includes the following four steps.
 i. For each vertex v ∈ V, compute the sub tree weighted distance at v, stwrd
(v).
ii. For each vertex v ∈ V, compute reduction (r , v ).

iii. Compute max r =max {reduction (r , v ); v ∈ V.

iv. The end point is the vertex v with reduction (r , v )= max r .

0.5 1(1)
1

2(.7) 3(1)
0.7
0.7
0.3
4(1) 0.6
6(.8) 7(.7)

5(.6)
0.5
1
9(.5)
8(1)
Figure 3.4

Step 1: find the end point of the given tree

(i) compute size (v)

V 1 2 3 4 5 6 7 8 9

Size - 2.76 1.04 1 0.6 0.25 0.7 1 0.5

(ii) Compute reduction (r , v ¿where r =1.

Reduction:
 ( r , u2 )=1.38 , ( r , u3 ) =1.04 , ( r , u4 ) =2.08 ,

( r , u5 ) =1.74 , ( r ,u 6 )=1.79 , ( r , u7 )=1.53 , ( r , u8 ) =3.0 8 , ( r ,u 9 )=1.94

(iii) Since the highest reduction is 3.08, the corresponding vertex 8 is the end point e 1=8

Step 2: Re – root the tree e 1

8(1)
1

4(1)
0.7

2(.7)
0.5 0.5

1(1) 5(.6)
1

3(1)
0.3
0.7
6(.5) 0.5
9(.5)
7(.7)

Figure 3.5

Step 3: find the end point of the re – rooted tree.

(i) Compute sub tree weighted distance ( stwrd )

 V 1 2 3 4 5 6 7 8 9

Size 2.79 0.36 1.04 7.8 0.6 0.25 0.7 −¿ 0.5

(ii) Compute reduction (r , v ¿where r =8.

Reduction: ( r , 7 )=10.537 since the highest reduction is 10.537 the corresponding vertex 7 is the
end point, e 2=7

Step 4: the path e 1to e 2 forms the core of the tree

1(1)
0.5 1

2(.7)
0.7 3(1)
0.6 0.3
0.7
4(1)
5(.6) 6(.5)
7(.7)
1 0.5

8(1)
9(.5)

Figure 3.6
CHAPTER 4
 APPLICATIONS

 2D matrix games:

In 2d matrix games can be used to find the optimal path for maximum sum along
starting to end points and many variations of it can be found online.

 Spanning trees:

Weighted graphs are used to find the minimum spanning tree from graph which
depicts the minimal cost to traverse all nodes in the graph.

 Constraints graphs:

Graphs are often used to represent constraints among items. Used in scheduling,
product design, asset allocation, circuit design, and artificial intelligence.

 Dependency graphs:

Directed weighted graphs can be used to represent dependencies or precedence order

among items. Priority will be assigned to provide a flow in which we will solve the problem
or traverse the graph from highest priority to lowest priority. Such graphs are often used in
large projects in laying out what components rely on other components and are used to
minimize the total time or cost to completion while abiding by the dependencies.
 Compilers:

Weighted graphs are used extensively in compilers. They can be used for type
inference, for so-called data flow analysis, and many other purposes such as query
optimization in database languages.

 Artificial Intelligence:

Weighted graphs are used in artificial intelligence for decision-making processes,

such as in game trees for determining the best move in a game.

 Image Processing:

Weighted graphs are used in image processing for segmentation, where the weight of
the edges represents the similarity between two pixels.

 Natural Language Processing:

Weighted graphs are used in natural language processing for text classification, where
the weight of the edges represents the similarity between two words.

 Transportation networks:

Using weighted graphs, we can figure things out like the path that takes the least time,
or the path with the least overall distance. This is a simplification of how weighted graphs
can be used for more complex things like a GPS system. Graphs are used to study traffic
patterns, traffic light timings and much more by many big tech companies such as OLA,
UBER, RAPIDO, etc. Graph networks are used by many map programs such as Google
Maps, Bing Maps, etc.
 Document link graphs:

Link weighted graphs are used to analyze relevance of web pages, the best sources of
information, and good link sites by taking the count of the number of views as weights in the
graph.

 Epidemiology:

Weighted graphs can be used to find the maximum distance transmission from an
infectious to a healthy person.

 Graphs in quantum field theory:

Vertices represent states of a quantum system, and the edges represent transitions
between them. The graphs can be used to analyze path integrals and summing these up
generates a quantum amplitude. Research to find maximum frequency along a path can be
done using weighted graphs.

 Social network graphs:

We can find which all users are connected in a network both directly (direct
connection) and indirectly (indirect connection). But now weighted graphs are also used in
social media for many purposes, for example, in recent times Instagram is using features like
close friends which is not the same as all friends these features are being implemented using
weighted graphs.

 Network packet traffic graphs:

Network packet traffic graphs are used for analyzing network security, studying the
spread of worms, and tracking criminal or non-criminal activity.
CONCLUSION
 CONCLUSION

When comparing fig7 & fig10 the core of a rough tree is different from w-core of the
weighted rough tree. Hence the vertex weights have a direct impact on the decision of selecting a
facility location.

We make a further study to the combination of rough set and graph theory. Graph theory
possesses a sophisticated mathematical structure. And it has been widely used in the real world.
So, we hope our work in this paper could contribute to the theoretical development and
applications of rough set.
BIBLIOGRAPHY
 BIBLIOGRAPHY

1. Abd-El Aziz E. Radwan, Mohammed Shokry Nayle, Ahmed Ibrahem Nasir, New rough

set properties on graph theory, Int. J. Contemp. Math. Sciences, 7 (2012), no. 25, 1217 –

1232.

2. E.A. Albacea, Parallel algorithm for finding a core of a tree network, Information

Processing Center, 51 (1994), 223-226. http://dx.doi.org/10.1016/0020-0190(94)00102-2.

3. Anjan Mukherjee, S. Bhattacharya Halder, Fuzzy Sets and Fuzzy Topology, 2015.

4. Frank Harary, New Directions in the theory of Graphs, Academic Press, 1971. [8].

Zdzislaw Pawlak, Rough sets, Int. Journal of Computer and Information Sciences, 11

(1982), 341-356. http://dx.doi.org/10.1007/bf01001956 Received: March 24, 2016;

Published: June 1, 201

5. Fred Bukley, Frank Harary, Distance in Graphs, Addision –Wesly, Red Wood city, CA,

1990. 1 3(1) 7 1 6(.5) 8 5 1 4 1 2 1 8(1) 9(.5) 4(1) 7(.7)) 5(.6) 2(.7) 1(1) 1)1.

6. E. Minieka and N.H, Patel, On finding the core of a tree with a specific length, Journal of

Algorithm, 4 (1983), 345-352. http://dx.doi.org/10.1016/0196-6774(83)90015-9.

7. A Rosenfield, Fuzzy Graphs, Chapter in In Fuzzy Sets and Their Applications to

Cognitive and Decision Processes, L.A. Zadeh, K. S. Fu, M. Shimura, (Eds) Academic

Press, Newyork, 1975, 77-95. http://dx.doi.org/10.1016/b978-0-12-775260-0.50008-6.