Energy of Fuzzy Labeling in Complete Graph through Hamiltonian

International Journal of Mathematics Trends and Technology (IJMTT) – Volume 44 Issue 1- April 2017
ENERGY OF FUZZY LABELING IN
COMPLETE GRAPH THROUGH
HAMILTONIAN CIRCUIT
S.Vimala
1
A.Nagarani 2
Assistant Professor,
Department of Mathematics,
Mother Teresa Women’s University,
Tamilnadu, India
[email protected]
Ph.D Research Scholar,
Department of Mathematics,
Mother Teresa Women’s University,
Tamilnadu, India
[email protected]
Abstract: A Hamiltonian circuit includes each vertex
of the graph once and only once. This paper
generalizing the energy of fuzzy labeling graph of
complete graphs through Hamiltonian circuit and
studied properties of complete graph. Discussion of
upper bound and lower bound of energy.
Keyword: complete graph, fuzzy labeling graph,
energy of fuzzy labeling graph, Hamiltonian circuit
I. INTRODUCTION
Energy of graph is the sum of eigen values of
adjacency matrix. This name suggests by energy in
chemistry. The study of
– electron energy in
chemistry dates back to 1940’s but it is in 1978 that
I.Gutman defined it mathematically for all graphs.
Organic molecules can be represented by graphs
called molecular graphs. In [2] R. Balakrishnan
defined the energy of
electrons of the molecule is
approximately the energy of its molecular graph.
Energy of graphs has many mathematical properties
which are being investigated. The nature of values
discussed in energy of graph is never an odd integer
[3] and energy of a graph is never the square root of
an odd integer [14]. Study of Energy of different
graphs such as regular, non-regular, circulate and
random graphs, signed graphs, weighted graphs
[4,5,6,8,16] by I.Gutman and Shao. In [1] Anjali
Narayanan and Sunil Mathew introduced concept of
the energy of fuzzy graphs.
In 1965 Fuzzy relations on a set was first defined by
Zadeh in 1965[19].A fuzzy set is defined
mathematically by assigning to each possible
individual in the universe of discourse a value,
representing its grade of membership, which
ISSN: 2231-5373
corresponds to the degree, to which that individual is
similar or compatible with the concept represented by
the fuzzy set. Fuzzy relation fuzzy graph introduced
by Kaufman in 1973 . Fuzzy graphs have many more
applications in modeling real time systems where the
level of information inherent in the system varies
with different level of precision. In 1975 Azriel
Rosenfield developed the structure of fuzzy graphs
and obtained analogs of several graph theoretical
concepts like bridge and tree [15], Complement fuzzy
tree[17], fuzzy line graph[9], fuzzy cycle[10] ,
established some characterization of fuzzy tree using
fuzzy bridges and fuzzy cut nodes [12]. In [11]
introduced the concept of bipartite fuzzy graph.
S.Vimala and A.Nagarani [13,18] introduced the
concept of energy of fuzzy labeling graph. Our result
consider for simple directed in degree graphs.
II. PRELIMINARIES
Hamilton path: [7] A Hamilton path in a graph is a
path that includes each vertex of the graph once and
only once.
Hamiltonian circuit: [7] A Hamiltonian circuit is a
circuit that includes each vertex of the graph once
and only once.
Hamiltonian graph: [7] If a graph has a
Hamiltonian circuit, then the graph is called a
Hamiltonian graph. Number of Hamiltonian circuit in
KN is (N-1)
Complete graph: [7] A graph with N vertices in
which every pair of distinct vertices is joined by an
edge is called a Complete graph on N vertices and is
denoted by the symbol KN .
Fuzzy graph: [11] Let U and V be two sets. Then
is said to be a fuzzy relations from U V to [0,1]. A
http://www.ijmttjournal.org
Page 1
47
International Journal of Mathematics Trends and Technology (IJMTT) – Volume 44 Issue 1- April 2017
fuzzy graph G= (
) is a pair of function of vertices
and edges consider
:V [0,1] and
:V V
[0,1], where for all u,v V,we have (u,v) ≤ (u)
(v).
Fuzzy Path: [11 ] A path P in a fuzzy graph is a
sequence of distinct nodes v 1 , v 2 , …, v n such that
(v i ,v i+1 ) 0; 1 i n: here n 1 is called the length
of the path P.
Fuzzy labeling graph:[11] A graph G = (
) is said
to be a fuzzy labeling graph, if
[0,1] and
:V V [0,1] is bijective such that the membership
value of edges and vertices are distinct and (u,v)
(u)
(v) for all u, v V.
Proposition 1:[11] Every fuzzy labeling graph has at
least one weakest arc.
Proposition 2:[12 ] A cycle graph G* is said to be a
fuzzy labeling cycle graph if it has fuzzy labeling.
Energy of fuzzy labeling graph:[13,18] The
following three conditions are true if the graph is
called a energy of fuzzy labeling graph.
E(G) =∑ | |
μ (u, v )
0
μ (u, v ) σ(u) Ʌ σ(v)
The
bounds
of
energy
are
√ ∑
(
)| |
>√ ( ∑
)
[2,1] derived lower and upper bound of the energy
graph and fuzzy energy graph. By above statement
proved eigen values based on that fuzzy energy.
Fuzzy energy calculated by [13,18].So fuzzy energy
resulted by
Example
Let G be directed fuzzy graph. Consider in degree
values form circular graph.
If N =3, Number of distinct Hamiltonian circuit has
(3 -1) = 2.(i.e) 2 Hamiltonian circuit Namely ABCA,
ACBA.
 0 0.4 0 
and
0 0.7 
0
0.3 0
0 
A 1 Fl (G)= 
 0 0 0.3 
A 2 Fl (G)= 0.4 0 0 


 0 0.7 0 
>
EFl (G).
III. MAIN RESULTS
Theorem 1. Let KN [Fl (G)] be a complete fuzzy
(
)
labeling graph |V| = N vertices and µ =
edges.
If N=3, then the number of distinct Hamiltonian
circuit has (N -1) and eigen values and energies are
constant.
Proof:
Let KN be a directed simple complete graph. If fuzzy
graph G = KN , then sum of the degrees of all
vertices is N (N-1). By the Euler’s sum of degrees
(
)
theorem that the number of edges is
.If every
The eigen values are 0.4380, 0.4380, 0.4380, Energy
= 1.3140, Lower Bound = 2.1071, Upper Bound =
1.6225 in the circuits ABCA, ACBA.
Hence Hamiltonian circuit has same eigen value and
same energies in K3 .
Theorem 2. Let KN [Fl (G)] be a complete fuzzy
(
)
labeling graph |V| = N vertices and µ =
N= 4,
then the pair of Hamiltonian circuit has same
energies and same eigen values in (N -1) .
Proof:
If N = 4, Number of distinct Hamiltonian circuit has
(N -1) (i.e.) 6 Hamiltonian circuits, Namely
ABCDA, ADCBA, ABDCA, ADBCA, ACBDA,
ACDBA .
vertex is connected to every other vertex then
Hamilton circuits form in different ways (with
respect to in degree) to rearrange (N-1) vertices . So
KN has (N-1) Hamiltonian circuit. Form different
adjacency matrix A l (G).Find eigen values by
determinant of
adjacency matrix
, ,….,
(say).The energy of graph E (G) =∑ | |.Eigen
value and energy of Hamiltonian circuit is constant.
Preposition
The lower bound of energy is greater than the upper
bound energy of Hamiltonian circuit.
Proof:
ISSN: 2231-5373
http://www.ijmttjournal.org
Page 2
48
International Journal of Mathematics Trends and Technology (IJMTT) – Volume 44 Issue 1- April 2017
0 
 0 0.4 0
A 2 Fl (G)=  0
0 0.8 0 
0
0.4
0
0
0 0.14 
0



0
0 
0.2 0
0
0
0
0.4
0


A 3 Fl (G)= 
A 4 Fl (G)=  0
0
0 0.9 
0
 0
0.3 0.8 0
0
 0.3



0
0
0.14
0


 0
0 0.3 0 
 0
 0
A 5 Fl (G)= 
 A 6 Fl (G)= 
0
0
0
0.9


 0.4
 0 0.8 0
0 
 0



0
0 
 0.2 0
 0
A 1 Fl (G)= 
0.2 
0 
0.8 0
0

0 0.14 0 
0
0
0
0
0.2 
0 0.8 0 
0
0
0 

0.9 0
0 
0 0.3 0 
0
0
0 
0
0 0.4 

0.9 0
0 
0
0
(i) The eigen values are 0.3077,0.3077,-0.3077,
0.3077Energy =1.2308, Lower Bound =2.6223,Upper
Bound = 2.6223 in the circuits ABCDA, ADCBA.
(ii) The eigen values are -0.3507, 0.3507, 0.3507,
0.3507, Energy = 1.4028, Lower Bound = 2.9388,
Upper Bound = 0.8274 in the circuits ABDCA,
ADBCA.
(iii) The eigen values are -0.4559, 0.4559, 0.4559,
0.4559, Energy = 1.8236, Lower Bound = 3.5552,
Upper Bound = 0.8159 in the circuits ACBDA,
ACDBA.
Hence every pair of Hamiltonian circuit has same
energy and same eigen value in K5 .
Theorem 3. Let KN [Fl (G)] be a complete fuzzy
(
)
labeling graph |V| = N vertices and µ =
edges
and 5 ≤ n ≤ 7 then the Hamiltonian circuit has either
same eigen values or difference in (N -1)
Proof:
Case(i): If N = 5,it has 24 Hamiltonian circuit the
first five circuits are ABCDEA, ABCEDA,
ABDCEA, ABDECA, ABECDA.
A 1 Fl (G)=  0
0.4
0
0

0
0.1
0
0
0
0
0  A F (G)= 
0
2 l
0.8 0
0 

0
0 0.4 0 


0 0 0.19 
0.2
 0

0 0
0 
0
0
0
0.4
0
0
0
0.8
0
0
0
0
0
0 
0 
0.13

0
0 
0.19 0 
0
0
0
(i) The eigen values are 0.3000, 0.3000, 0.3001,
0.3001, 0.3000 Energy =1.5002 in the circuite
ABCDEA.
(ii) The eigen values are 0.2753, 0.2753, 0.2753,
0.2753, 0.2753,
Energy =1.3765 in the circuite
ABCEDA.
ISSN: 2231-5373
Hence the Eigen value difference is 0.001 for K5
Case(ii): If N=6. It has 120 Hamiltonian circuit.
The first five circuits are ABCDEFA, ABCDFEA,
ABDCEFA, ABDEFCA, ABFCDEA .
A 1 Fl (G)=  0
0

0

0
0

0.4
A 3 Fl (G)=  0
0

0

0
0

0.4
0.5 0
0
0
0 0.9
0
0
0
0
0 0.14 0
0 0 0.19
0
0
0
0
0
0
0
0
0.5
0
0
0
0
0
0.8
0
0 0 0
0 0.14 0
0
0
0
0
0 0.24
0
0
0
0
0  A 2 Fl (G)=  0
0
0 

0
0 


0 
0
0.3
0.24


0 
0
0  A 4 Fl (G)=  0
0
0 

0.12
0.1


0 
0
0
0 


0 
0
0 
0 
0 0.14 0
0 

0 0 0.19 0 
0 0
0
0 

0 0
0 0.24
0.5 0
0
0
0 0.9
0
0
0
0
0
0
0.5
0
0
0
0
0
0 
0 
0 0 0.19 0 

0 0 0 0.24
0 0 0
0 

0.13 0 0
0 
0
0
0
0
0.8
0
(i) The eigen values are -0.3236, 0.3236, 0.3236,
0.3236, 0.3236, 0.3236, Energy =1.9416 in the
circuite ABCDEFA
(ii) The eigen values are 0,0.3244, 0.3244, 03244,
0.3244, 0.3244, Energy =1.9464 in the circuite
ABCDFEA,
(ii) The eigen values are 0, 0.3061, 0.3061,
0.3061, 0.3061, 0.3061, Energy =1.8366 in the
circuite ABDCEFA.
(ii) The eigen values are -0.2488, 0.2488, 0.2488,
0.2488, 0.2488, 0.2488 Energy =1.4928 in the
circuite ABDCEFA
Case (iii): If N=7. It has 720 Hamiltonian circuit.
The
first
five
circuits
are
ABCDEFGA,
ABDCEGFA,
ACBEDFGA,
ADBCEGFA,
AEDBCFGA
0
A 1 Fl (G)=  0

0

0
0

0
0.8

0
A 2 Fl (G)=  0
0

0
0

0.7
0

http://www.ijmttjournal.org
0 
0 
0
0 0.19 0
0
0 

0
0
0 0.24 0
0 
0
0
0
0 0.28 0 

0
0
0
0
0 0.32 
0
0
0
0
0
0 
0.5 0
0
0
0
0 
0
0 0.13 0
0
0 
0
0
0 0.18 0
0 

0 0.19 0
0
0
0 
0
0
0
0
0 0.27 

0
0
0
0
0
0 
0
0
0
0 0.32 0 
0.5
0
0
0
0
0
0.14
0
0
0
Page 49
3
International Journal of Mathematics Trends and Technology (IJMTT) – Volume 44 Issue 1- April 2017
A 3 Fl (G) =
0
0.2
0
0
0
0 
0
0

0
0
0
0.12
0
0


 0 0.14 0
0
0
0
0 


0
0
0
0
0.23
0 
0
0
0
0 0.24
0
0
0 


0
0
0
0
0
0.32 
0
0.8
0
0
0
0
0
0 

A 4 Fl (G) =  0
0
0
0
0.14
 0
 0
0
0

0
 0 0.13
 0
0
0

0
0
 0.7
 0
0
0

0.3
0
0
0
0
0
0
0 
0 
0.18
0
0 

0
0
0 
0
0
0.29 

0
0
0 
0
0.82
0 
0
0
0
0
(i)The eigen values are 0.3019, 0.3019, 0.3019,
0.3020,0.3020,0.3020, 0.3020 Energy =2.1137 in the
circuite ABCDEFGA.
(ii) The eigen values are 0.2827, 0.2827, 0.2827,
0.2827, 0.2827, 0.2827, 0.2827, Energy =1.9789 in
the circuite ABDCEGFA.
(iii) The eigen values are 0.2412, 0.2412, 0.2412,
0.2412, 0.2412, 0.2412, 0.2412, Energy =1.6884in
the circuite ACBEDFGA.
(iv) The eigen values are 0.2516, 0.2516, 0.2516
0.2516 , 0.2516, 0.2516 , 0.2516 Energy =1.7612 in
the circuite ADBCEGFA,
[7] Harary,The book “Graph theory” in Wesley Publication
Company 1969.
[8] G.Indulal and A.Vijayakumar, Energies of some nonregular graphs J.M ath.Chem. 42 (2007) 377- 386 .
[9] J.N.M ordeson, Fuzzy line graphs, Pattern Recognition
Letter 14 (1993) 381- 384.
[10] J.N.M ordeson, and P.S.Nair, Cycles and cocycles of
fuzzy graphs, Inform. Sci.90 (1996) 39 -49
[11] A.Nagoorgani, V.T.Chandrasekaran,”A First Look at
Fuzzy Graph Theory “in Allied Publishers Pvt. Ltd
[12] A.Nagoorgani , Fuzzy Bip artite graphs , Journal of
Quantitative methods, 2 No . 2 (2006), 54-60
[13] A.Nagarani and S.Vimala, Energy Of Fuzzy Labeling
Graph EF l(G) –Part II, International Journal of
Innovative Research in Science, Engineering and
Technology Vol. 5, Issue 9, September 2016
[14] S.Pirzada and I.Gutman, Energy of a graph is never
the square root of an odd integer, Appl. Anal.Discrete
M ath . 2 (2008) 118 – 121.
[15] A.Rosenfield, Fuzzy Graph, In:L.A.Zadeh , K.S.Fu,
and M .Shimura,Editors, Fuzzy sets and their
Applications to Cognitive and Decision Process
Academic Press ,New York ,77 – 95(1975).
[16] I.Shparlinski, On the energy of some circulant graphs,
Linear Algebra Appl .414 (2006) 378- 382.
[17] M .S. Sunitha, and A.Vijayakumar , A Characterization
of fuzzy trees . Information Science, 113(1999) ,293 –
300.
[18] S.Vimala and A.Nagarani, Energy Of Fuzzy Labeling
Graph EF l(G) –Part I,International Journal Of
Scientific & Engineering Research, Volume 7, Issue 4,
APRIL-2016.
[19] L.A. Zadeh ,Fuzzy sets.Information and control, 8,
(1965),338-353.
IV. CONCLUS ION
Continuing the process KN has (N-1)!,Hamiltonian
circuit of 5 ≤ N ≤ 7 has either a same eigen values or
eigen values difference from 0.0001.
REFERENCE
[1] N .Anjali Narayanan, Sunil M athew, Energy of a fuzzy
graph, Annals of Fuzzy M athematics and Informatics,
(2013) ,Vol 6, No,3. 455 – 465.
[2] R.Balakrishnan, The energy of a graph, Linear Algebra
Appl.387 (2004) 287 -295 .
[3] R.B. Bapat and S.Pati, Energy of a graph is never an
odd interger, Bull Kerala M ath. Asso.1 (2004) 129 -132
[4] W.Du, X.Li and Y.Li,Various energies of random
graphs, M ATCH Commun. M ath. Compute. Chem. . .
.64 (2010) 251-260.
[5] I.Gutman and S.Zare Firoozabadi. J.A.de la Prena,
J.Rada, On the energy of regular graphs. M ATCH
Commun. M ath. Comput .Chem. 57 (2007) 435-442 .
[6] K.A. Germina and S.Hameed, Thomas Zaslavsky, On
products and line graphs of signed graphs, their
eigenvalues and energy, Linear Algebra Appl.435
(2011) 2432-2450.
ISSN: 2231-5373
http://www.ijmttjournal.org
Page 50
4

Download Report