ANTIPODAL BIPOLAR FUZZY GRAPHS. Muhammad Akram. Sheng-Gang Li. K.P. Shum. 1. Introduction
|
|
- Henry Barnett
- 5 years ago
- Views:
Transcription
1 itlin journl of pure nd pplied mthemtis n (97 110) 97 ANTIPODAL BIPOLAR FUZZY GRAPHS Muhmmd Akrm Punj University College of Informtion Tehnology University of the Punj Old Cmpus, Lhore Pkistn e-mil: Sheng-Gng Li College of Mthemtis nd Informtion Siene Shnxi Norml University , Xi n Chin e-mil: shenggngli@yhoo.om.n K.P. Shum Institute of Mthemtis Yunnn University Kunming, Chin e-mil: kpshum@ynu.edu.n Astrt. The onept of n ntipodl ipolr fuzzy grph of given ipolr fuzzy grph is introdued. Chrteriztions of ntipodl ipolr fuzzy grphs re presented when the ipolr fuzzy grph is omplete or strong. Some isomorphi properties of ntipodl ipolr fuzzy grph re disussed. The notion of self medin ipolr fuzzy grphs of given ipolr fuzzy grph is lso introdued. Keywords nd phrses: ntipodl ipolr fuzzy grphs, medin ipolr fuzzy grphs, self medin ipolr fuzzy grphs Mthemtis Sujet Clssifition: 05C Introdution Conepts of grph theory hve pplitions in mny res of omputer siene (suh s dt mining, imge segmenttion, lustering, imge pturing, networking et.). For exmples, dt struture n e designed in the form of trees, modeling of network topologies n e done using grph onepts. The most importnt
2 98 muhmmd krm, sheng-gng li, k.p. shum onept of grph oloring is utilized in resoure llotion nd sheduling. The onepts of pths, wlks nd iruits in grph theory re used in trveling slesmn prolem, dtse design onepts, nd resoure networking. This leds to the development of new lgorithms nd new theorems tht n e used in tremendous pplitions. A notion hving ertin influene on grph theory is fuzzy set, whih is introdued y Zdeh [17] in 1965; tully, the theory of fuzzy sets hs lredy eome vigorous reserh re whih intersets with mny reserh res, suh s medil nd life sienes, mngement sienes, soil sienes, engineering, sttistis, grph theory, rtifiil intelligene, signl proessing, multi-gent systems, pttern reognition, rootis, omputer networks, expert systems, deision mking nd utomt theory, et. A fuzzy set on given set X is just mpping A : X [0,1]. Bsed on the sme ide, Zhng [20] defined the notion of ipolr fuzzy set on given set X in 1994, whih is just mpping A : X [ 1,1], where the memership degree 0 of n element x mens tht the element x is irrelevnt to the orresponding property, the memership degree in (0, 1] of n element x indites tht the element somewht stisfies the property, nd the memership degree in [ 1,0) of n element x indites tht the element somewht stisfies the impliit ounter-property. In 1975, Rosenfeld [13] disussed the onept of fuzzy grph whose si ide ws introdued y Kuffmnn [11] in By onsidering fuzzy reltions etween fuzzy sets nd developing struture of fuzzy grphs, Rosenfeld otined nlogs of severl grph theoretil onepts. Bhtthry [9] gve some remrks on fuzzy grphs. The omplement of fuzzy grph ws defined y Mordeson [12] nd further studied y Sunith nd Vijykumr [15]. Ahmed nd Gni disussed the onepts of perfet fuzzy grph nd self medin fuzzy grph in [7]. Bsed on the notion of intuitionisti fuzzy set [5], Atnssov [5] introdued the onepts of intuitionisti fuzzy reltion nd intuitionisti fuzzy grphs. Reently, the ipolr fuzzy grphs hve een defined nd disussed in [1-3] sed on the notion of ipolr fuzzy set. The present pper ontinues to study ipolr fuzzy grphs. We introdue the onepts of ntipodl ipolr fuzzy grph nd self medin ipolr fuzzy grph of given ipolr fuzzy grph, nd prove severl hrteriztions theorems of ntipodl ipolr fuzzy grphs whose ipolr fuzzy grph re omplete or strong. We lso disuss isomorphi properties of ntipodl ipolr fuzzy grph. 2. Preliminries In this setion, we review some elementry onepts whose understnding is neessry fully enefit from this pper. By grph G = (V,E), we men non-trivil, finite, onneted nd undireted grph without loops or multiple edges. Formlly, given grph G = (V,E), two verties x, y V re sid to e neighors, or djent nodes, if {x,y} E. The ntipodl grph of grph G, denoted y A(G ), hs the sme vertex set s G with n edge joining verties u nd v if d(u,v) is equl to the
3 ntipodl ipolr fuzzy grphs 99 dimeter of G. For grph G of order p, the ntipodl grph A(G ) = G if nd only if G = K p. If G is non-omplete grph of order p, then A(G ) G. For grph G, the ntipodl grph A(G ) = G if nd only if () G is of dimeter 2 or () G is disonneted nd the omponents of G re omplete grphs. A grph G is n ntipodl grph if ut only if it is the ntipodl grph of its omplement. A grph G is n ntipodl grph if nd only if (i) dim(g ) = 2 or (ii) G is disonneted nd the omponents of G re omplete grphs. The self medin fuzzy grphs were introdued y Ahmed nd Gni in [7] The medin of grph G is the set of ll verties v of G for whih the vlue d G (v) is minimized. A grph is distne-lned (lso lled self-medin) if its medin is the whole vertex set. Thus, grph G is self-medin if nd only if the vlue d G (v) is onstnt over ll verties v of G. The sttus, or distne sum, of given vertex v in grph is defined y s(v) = u vd(u,v), where d(u,v) is the distne from vertex u to v. In other words, self medin grph G is one in whih ll the nodes hve the sme sttus s(v). The grphs C n, K n,n nd K n re self medin. The sttus of vertex v i is denoted y S(v i ) nd is defined s S(v i ) = δ(v i,v j ). The totl sttus of v j V fuzzy grph G is denoted y t[s(g )] nd is defined s t[s(g )] = S(v i ). v i V The medin of fuzzy grph G, denoted, is the set of nodes with minimum sttus. A fuzzy grph G is sid to e self-medin if ll the verties hve the sme sttus. Every self-medin fuzzy grph is self entered fuzzy grph. Every ue Q n is self-medin fuzzy grph. Definition 2.1 [17, 18] A fuzzy suset µ on set X is mp µ : X [0,1]. A fuzzy inry reltion on X is fuzzy suset µ on X X. By fuzzy reltion we men fuzzy inry reltion given y µ : X X [0,1]. Definition 2.2 [20] Let X e nonempty set. A ipolr fuzzy set B in X is n ojet hving the form B = {(x, µ P B (x), µn B (x)) x X} where µ P B : X [0, 1] nd µn B : X [ 1, 0] re mppings. We use the positive memership degree µ P B (x) to denote the stisftion degree of n element x to the property orresponding to ipolr fuzzy set B, nd the negtive memership degree µ N B (x) to denote the stisftion degree of n element x to some impliit ounter-property orresponding to ipolr fuzzy set B. If µ P B (x) 0 nd µn B (x) = 0, it is the sitution tht x is regrded s hving only positive stisftion for B. If µ P B (x) = 0 nd µn B (x) 0, it is the sitution tht x does not stisfy the property of B ut somewht stisfies the ounter property of B. It is possile for n element x to e suh tht µ P B (x) 0 nd µn B (x) 0 when the memership funtion of the property overlps tht of its ounter property over some portion of X.
4 100 muhmmd krm, sheng-gng li, k.p. shum For the ske of simpliity, we shll use the symol B = (µ P B, µn B ) for the ipolr fuzzy set B = {(x, µ P B(x), µ N B(x)) x X}. A nie pplition of ipolr fuzzy onept is politil epttion (mp to[0, 1]) nd non-epttion (mp to [-1, 0]). Definition 2.3 [20] Let X e nonempty set. Then, we ll mpping A = (µ P A,µN A ) : X X [0,1] [ 1,0] ipolr fuzzy reltion on X suh tht µ P A (x,y) [0,1] nd µn A (x,y) [ 1,0]. Definition 2.4 [1] Let A = (µ P A,µN A ) nd B = (µp B,µN B ) e ipolr fuzzy sets on set X. If A = (µ P A,µN A ) is ipolr fuzzy reltion on set X, then A = (µp A,µN A ) is lled ipolr fuzzy reltion on B = (µ P B,µN B ) if µp A (x,y) min(µp B (x),µp B (y)) nd µ N A (x,y) mx(µn B (x),µn B (y)) for ll x, y X. A ipolr fuzzy reltion A on X is lled symmetri if µ P A (x,y) = µp A (y,x) nd µn A (x,y) = µn A (y,x) for ll x, y X. Definition 2.5 [3] Let G e onneted ipolr fuzzy grph. The µ P -distne, δ µ P(v i,v j ), is the smllest µ P -length of ny v i v j pth P in G, where v i,v j V. Tht is, δ µ P(v i,v j ) = min(l µ P(P)). The µ N -distne, δ µ N(v i,v j ), is the lrgest µ N -length of ny v i v j pth P in G, where v i,v j V. Tht is, δ µ N(v i,v j ) = mx(l µ N(P)). Thedistne, δ(v i,v j ),isdefinedsδ(v i,v j )=(δ µ P(v i,v j ),δ µ N(v i,v j )). For eh v i V, the µ P -eentriity of v i, denoted y e µ P(v i ) nd is defined s e µ P(v i )=mx{δ µ P(v i,v j ) : v i V,v i v j }. Forehv i V, theµ N -eentriity of v i,denotedye µ N(v i )ndisdefinedse µ N(v i )=min{δ µ N(v i,v j ) : v i V,v i v j }. For eh v i V, the eentriity of v i, denoted y e(v i ) nd is defined s e(v i ) = (e µ P(v i ),e µ N(v i )). The µ P -rdius of G is denoted y r µ P(G) nd is defined s r µ P(G) = min{e µ P(v i ) : v i V}. The µ N -rdius of G is denoted y r µ N(G) nd is defined s r µ N(G) = mx{e µ N(v i ) : v i V}. The rdius of G is denoted y r(g) nd is defined s r(g) = (r µ P(G),r µ N(G)). The µ P -dimeter of G is denoted y d µ P(G) nd is defined s d µ P(G) =mx{e µ P(v i ) : v i V}. The µ N -dimeter of G is denoted y d µ N(G) nd is defined s d µ N(G) =min{e µ N(v i ) : v i V}. The dimeter of G is denoted y d(g) nd is defined s d(g) = (d µ P(G),d µ N(G)). A onneted ipolr fuzzy grph G is self entered grph, if every vertex of G is entrl vertex, tht is r µ P(G) = e µ P(v i ) nd r µ N(G) = e µ N(v i ), v i V. 3. Antipodl ipolr fuzzy grphs Definition 3.1 Let G = (A,B) e ipolr fuzzy grph. An ntipodl ipolr fuzzy grph A(G) = (E,F) is ipolr fuzzy grph G = (A,B) in whih: () An ipolr fuzzy vertex set of G is tken s ipolr fuzzy vertex set of A(G), tht is, µ P E (x) = µp A (x) nd µn E (x) = µn A (x) for ll x V,
5 ntipodl ipolr fuzzy grphs 101 () If δ(x,y) = d(g), then { µ P µ P F (xy) = B (xy) if x nd y re neighors in G, min(µ P A (x),µp A (y)) if x nd y re not neighors in G, { µ N µ N F (xy) = B (xy) if x nd y re neighors in G, mx(µ N A (x),µn A (y)) if x nd y re not neighors in G. Tht is, two verties in A(G) re mde s neighorhood if the µ P µ N distne etween them is dimeter of G. Exmple 3.2 Consider ipolr fuzzy grph G suh tht A = {v 1,v 2,v 3 }, B = {v 1 v 2,v 1 v 3,v 2 v 3 }. v 1 v 1 ( 1 3, 1 6 ) ( 1 3, 1 6 ) ( 1 3, 1 4 ) ( 1 6, 1 5 ) ( 1 6, 1 5 ) (1 2, 1 5 ) ( 1 3, 1 2 ) ( 1 3, 1 7 ) (1 2, 1 5 ) ( 1 3, 1 7 ) v 3 v 2 v 3 v 2 Bipolr Fuzzy Grph By routine lultions, we hve, Antipodl Bipolr Fuzzy Grph Figure 1 δ µ P(v 1,v 2 ) = 6, δ µ P(v 1,v 3 ) = 3, δ µ P(v 2,v 3 ) = 3, δ µ N(v 1,v 2 ) = 6, δ µ N(v 1,v 3 ) = 7, δ µ N(v 2,v 3 ) = 9, e µ P(v 1 ) = 6, e µ P(v 2 ) = 6, e µ P(v 3 ) = 3, e µ N(v 1 ) = 6, e µ N(v 2 ) = 6, e µ N(v 3 ) = 7, d(g) = (6, 6), δ(v 1,v 2 ) = (6, 6) = d(g). Hene A(G) = (E,F), suh tht E = {v 1,v 2,v 3 } nd F = {v 1 v 2 }. Theorem 3.3 Let G = (A,B) e omplete ipolr fuzzy grph where (µ P A,µN A ) is onstnt funtion then G is isomorphi to A(G). Proof. Given thtg = (A,B)eomplete ipolr fuzzygrphwith(µ P 1,µN 1 ) = (k 1,k 2 ), where k 1 nd k 2 re onstnts, whih implies tht δ(v i,v j ) = (l 1,l 2 ), v i,v j V. Therefore, eentriity e(v i ) = (l 1,l 2 ), v i V, whih implies tht d(g) = (l 1,l 2 ). Hene δ(v i,v j ) = (l 1,l 2 ) = d(g), v i,v j V. Hene every pir of verties re mde s neighors in A(G) suh tht
6 102 muhmmd krm, sheng-gng li, k.p. shum () An ipolr fuzzy vertex set of G is tken s ipolr fuzzy vertex set of A(G), tht is, µ P E (v i) = µ P A (v i) nd µ N E (v i) = µ N A (v i) for ll v i V, () µ P F (v iv j ) = µ P B (v iv j ), sine v i nd v j re neighors in G µ N F (v iv j ) = µ N B (v iv j ), sine v i nd v j re neighors in G. It hs sme numer of verties, edges nd it preserves degrees of the verties. Hene G = A(G). Theorem 3.4 Let G : (A,B) is onneted ipolr fuzzy grph. Every ntipodl ipolr fuzzy grph is spnning sugrph of G. Proof. By the definition of n ntipodl ipolr fuzzy grph, A(G) ontins ll the verties of G. Tht is, () µ P E (x) = µp A (x) nd µn E (x) = µn A (x) for ll x V, nd () If δ(x,y) = d(g), then { µ P µ P F (xy) = B (xy) if x nd y re neighors in G, min(µ P A (x),µp A (y)) if x nd y re not neighors in G, { µ N µ N F (xy) = B (xy) if x nd y re neighors in G, mx(µ N A (x),µn A (y)) if x nd y re not neighors in G. Hene A(G) is spnning sugrph of G. Theorem 3.5 Let G e ipolr fuzzy grph, where risp grph G is n even or odd yle. If lternte edges hve sme memership vlues nd non-memership vlues, then G is self entered ipolr fuzzy grph. Theorem 3.6 Let G e ipolr fuzzy grph, where risp grph G is n even or odd yle. If lternte edges hve sme positive nd negtive vlues, then A µ P(G) nd A µ N(G) is the edge indued ipolr fuzzy sugrph of Ḡ, whose end verties of A µ P(G) nd A µ N(G) re with mximum µ P - eentriity nd minimum µ N - eentriity in G. Proof. If lternte edges hve sme positive nd negtive vlues, then µ P - distne etween non-djent verties is greter thn the djent verties nd µ N -distne etween non-djent verties is lesser thn the djent verties. Let µ P B (v i,v j ) e the lest mong ll other edges, then δ µ P(v i,v j ) = 1 µ P B (v i,v j ). Clim (i): Neighors in G re not neighors in A(G). Consider n ritrry pth onneting v k,v t suh tht (1) (v k,v t ) µ P B
7 ntipodl ipolr fuzzy grphs 103 If P is pth of length 2 etween v k,v t, then (2) l µ P(P) Hene δ(v k,v t ) 1 µ P B (v i,v j ) 1 µ P B (v i,v j ), sine y eqution (1) nd (2), whih implies tht δ(v i,v j ) < δ(v k,v t ) d(g), where δ(v k,v t ) µ P B nd(v i,v j ) µ P B. Tht is, δ(v i,v j ) < d(g), if (v i,v j ) µ P B. Therefore, if (v i,v j ) µ P B, then v i nd v j re not neighors in A(G). Clim (ii): Edges in A(G) re edges in Ḡ. If (v m,v n ) µ P F, then y Clim (i), (v i,v j ) µ P B. So, µ P F (v m,v n ) = min(µ P A (v m),µ P A (v n)), sine y the definition of A(G), whih implies tht edges in A(G) re edges in Ḡ. Hene A(G) is ipolr fuzzy sugrph of Ḡ, indued y the edges of Ḡ, whose end verties re with mximum µ P eentriity in G. Let (v i,v j ) E, then δ µ N(v i,v j ) = k. Clim (i): Neighors in G re not neighors in A(G). Consider n ritrry pth onneting v k,v t suh tht (3) (v k,v t ) µ N B If Q is pth of length 2 etween v k,v t, then (4) δ µ P(P) k Hene δ µ N(v k,v t ) δ µ N(v i,v j ), sine y eqution (3) nd (4), whih implies tht δ µ N(v k,v t ) d(g), where (v k,v t ) µ N B nd (v i,v j ) µ N B. Tht is, δ µ N(v i,v j ) d(g), if (v i,v j ) µ N B. Therefore, if (v i,v j ) µ N B, then v i nd v j re not neighors in A(G). Clim (ii): Edges in A(G) re edges in Ḡ. If (v m,v n ) µ N F, then y Clim (i), (v i,v j ) µ P B. So, µ N F(v m,v n ) = mx(µ N A(v m ),µ N A(v n )), sine y the definition of A(G), whih implies tht edges in A µ N(G) re edges in Ḡ. Hene A µ N(G) is ipolr fuzzy sugrph of Ḡ, indued y the edges of Ḡ, whose end verties re with minimum µ N eentriity in G.
8 104 muhmmd krm, sheng-gng li, k.p. shum Theorem 3.7 Let G e ipolr fuzzy grph, where risp grph G is n even or odd yle. If lternte edges hve sme positive nd negtive vlues, then A(G) is iprtite ipolr fuzzy grph. Theorem 3.8 Let G : (A,B) e onneted strong ipolr fuzzy grph, where risp grph G is n even or odd yle, suh tht (µ P A,µN A )(v i) = (k 1,k 2 ), v i µ P A nd v i µ N A. Then A(G) is the spnning ipolr fuzzy grph sugrph of Ḡ, indued y the edges of Ḡ, whose end verties re mximum µp - eentriity nd minimum µ N - eentriity in G. Proof. Let (v i,v j ) µ P B, δ µ P(v i,v j ) = 1 k 1. But for ny (v i,v j ) µ P B, δ(v k,v m ) 2 k 1. Tht isδ µ P(v i,v j ) = 1 k 1 < 2 k 1 δ µ P(v k,v m ), where (v i,v j ) µ P B, whih implies tht v i,v j re verties in A(G), ut re not neighors in A(G). Now, let (v i,v j ) µ N B, δ µ N(v i,v j ) > 1 k 1. But for ny (v i,v j ) µ N B, δ µ N(v i,v j ) δ µ N(v k,v m ), where (v i,v j ) µ N B, whih implies tht v i,v j re verties in A(G), ut re not neighors in A(G). The remining proof is similr to lim (ii) of ove Theorem nd hene we omit it. Theorem 3.9 If G 1 nd G 2 re isomorphi to eh other, then A(G 1 ) nd A(G 2 ) re lso isomorphi. Proof. As G 1 nd G 2 re isomorphi, the isomorphism h, etween them preserves the edge weights, so the µ P µ N -length nd µ P µ N -distne will lso e preserved. Hene, if the vertex v i hs the mximum µ P -eentriity nd minimum µ N -eentriity, in G 1, then h(v i ) hs the mximum µ P -eentriity nd minimum µ N -eentriity, in G 2. So, G 1 nd G 2 will hve the sme dimeter. If the µ P µ N - distne etween v i nd v j is (k 1,k 2 ) in G 1, then h(v i ) nd h(v j ) will lso hve their µ P µ N -distne s (k 1,k 2 ). The sme mpping h itself is ijetion etween A(G 1 ) nd A(G 2 ) stisfying the isomorphism ondition. (i) µ P E 1 (v i ) = µ P A 1 (v i ) = µ P A 2 (h(v i )) = µ P E 2 (h(v i )), v i G 1 (ii) µ N E 1 (v i ) = µ N A 1 (v i ) = µ N A 2 (h(v i )) = µ N E 2 (h(v i )), v i G 1 (iii) µ P F 1 (v i,v j ) = µ P B 1 (v i,v j ), if v i nd v j re neighors in G 1 µ P F 1 (v i,v j ) = min(µ P E 1 (v i ),µ P E 1 (v j )), if v i nd v j re not neighors in G 1 nd (iv) µ N F 1 (v i,v j ) = µ N B 1 (v i,v j ), if v i nd v j re neighors in G 1 µ N F 1 (v i,v j ) = mx(µ N E 1 (v i ),µ N E 1 (v j )), if v i nd v j re not neighors in G 1 As h : G 1 G 2 is n isomorphism, µ N F 1 (v i,v j ) = µ N B 2 (h(v i ),h(v j )),if v i nd v j re neighors in G 1 µ N F 1 (v i,v j ) = mx(µ N B 2 (v i ),µ N B 2 (v j )),if v i nd v j re not neighors in G 1 µ N F 1 (v i,v j ) = µ N B 2 (h(v i ),h(v j )),if v i nd v j re neighors in G 1 µ N F 1 (v i,v j ) = mx(µ N B 2 (v i ),µ N B 2 (v j )),if v i nd v j re not neighors in G 1
9 ntipodl ipolr fuzzy grphs 105 Hene µ P F 1 (v i,v j ) = µ P F 2 (h(v i ),h(v j )) nd µ N F 1 (v i,v j ) = µ N F 2 (h(v i ),h(v j )). So, the sme h is n isomorphism etween A(G 1 ) nd A(G 2 ). Theorem 3.10 If G 1 nd G 2 re omplete ipolr fuzzy grph suh tht G 1 is o-wek isomorphi to G 2 then A(G 1 ) is o-wek isomorphi to A(G 2 ). Proof. As G 1 is o-wek isomorphi to G 2, there exists ijetion h : G 1 G 2 stisfying, µ P A (v i) µ P A (h(v i)), µ P B (v i,v j ) = µ P B (h(v i),h(v j )), v i,v j V 1. If G 1 hs n verties, rrnge the verties of G 1 in suh wy tht µ P A (v 1) µ P A (v 2) µ P A (v 3)...µ P A (v n). As G 1 nd G 2 re omplete, o-wek isomorphi ipolr fuzzy grph, µ P B (v i,v j ) = µ P B (h(v i),h(v j )), v i,v j V 1. By Theorem 3.9 nd the definition of ntipodl ipolr fuzzy grph, we hve A(G i ) ontins ll the verties of G, where i = 1,2. Tht is, µ P E (x) = µp A (x) nd µn E (x) = µn A (x) for ll x V nd µ P F (v i,v j ) = µ P F (h(v i),h(v j )), v i,v j V 1. So, the sme ijetion h is o-wek isomorphism etween A(G 1 ) nd A(G 2 ). We stte the following Theorem without its proof. Theorem 3.11 If G 1 nd G 2 re omplete ipolr fuzzy grph suh tht G 1 is o-wek isomorphi to G 2 then A(G 1 ) is homomorphi to A(G 2 ). Remrk 1 If G is self omplementry ipolr fuzzy grph, then its ntipodl ipolr fuzzy grph my not e self omplementry. Exmple 3.12 Consider ipolr fuzzy grph G ( 1 8, 1 5 ) (1 5, 1 6 ) ( 1 8, 1 5 ) (1 5, 1 6 ) ( 1 10, 1 2 ) ( 1 10, 1 2 ) (1 5, 1 2 ) ( 1 8, 1 7 ) (1 3, 1 8 ) ( 1 8, 1 7 ) (1 3, 1 8 ) d G By routine lultions, we hve Figure 2 d A(G) δ(,) = (15, 4), δ(,) = (10, 2), δ(,d) = (10, 2), δ(,) = (5, 2), δ(,d) = (25, 6), δ(,d) = (20, 4), e() = (15, 2), e() = (20, 2), e(d) = (25, 2), d(g) = (25, 2). e() = (15, 2), Sine d(g) δ(x,y) for ll x, y V. Hene A(G) is n ntipodl ipolr fuzzy grph of G hving sme verties s in G only, nd no two verties in A(G) re mde s neighorhood sine their µ P µ N distne etween them is not equl to the dimeter of G.
10 106 muhmmd krm, sheng-gng li, k.p. shum Consider ipolr fuzzy grph G ( 8 1, 1 5 ) ( 1 8, 1 5 ) (1 5, 1 6 ) ( 1 8, 1 5 ) (1 5, 1 6 ) ( 1 8, 1 6 ) ( 1 8, 1 7 ) (1 ( 1 3, 1 8 ) ( 8 1, 1 7 ) (1 3, 1 8 ) 8, 1 7 ) d d G A(G) Figure 3 By routine lultions, we hve δ(,) = (8, 5), δ(,) = (24, 18), δ(,d) = (16, 11), δ(,) = (16, 13), δ(,d) = (8, 6), δ(,d) = (8, 7), e() = (24, 5), e() = (16, 5), e() = (24, 7), e(d) = (16, 6), d(g) = (24, 5). Sine d(g) δ(x,y) for ll x, y V. Hene A(G) is n ntipodl ipolr fuzzy grph of G hving sme verties s in G only, nd no two verties in A(G) re mde s neighorhood sine their µ P µ N distne etween them is not equl to the dimeter of G. ( 1 8, 1 5 ) ( 1 8, 1 5 ) (1 5, 1 6 ) ( 1 8, 1 5 ) ( 1 8, 1 6 ) ( 1 8, 1 5 ) ( 1 5, 1 6 ) ( 1 8, 1 7 ) (1 3, 1 8 ) ( 1 8, 1 7 ) d A(G) Figure 4 Clerly, A(G) is not isomorphi to A(G) Hene G is self omplementry, ut its ntipodl ipolr fuzzy grph A(G) is not self omplementry ipolr fuzzy grph.
11 ntipodl ipolr fuzzy grphs 107 Exmple 3.13 Consider ipolr fuzzy grph G ( 6 1, 1 3 ) ( 1 5, 1 4 ) (1 5, 1 5 ) ( 1 5, 1 4 ) (1 5, 1 5 ) ( 1 5, 1 4 ) ( 1 6, 1 3 ) ( 1 5, 1 4 ) (1 6, 1 3 ) ( 1 5, 1 4 ) (1 6, 1 3 ) G d A(G) d Figure 5 By routine lultions, we hve δ(,) = (5, 4), δ(,) = (11, 7), δ(,d) = (17, 10), δ(,) = (6, 3), δ(,d) = (12, 6), δ(,d) = (6, 3), e() = (17, 4), e() = (11, 3), e(d) = (17, 3), d(g) = (17, 3). e() = (12, 3), Sine d(g) δ(x,y) for ll x, y V. Hene A(G) is n ntipodl ipolr fuzzy grph of G hving sme verties s in G only, nd no two verties in A(G) re mde s neighorhood sine their µ P µ N distne etween them is not equl to the dimeter of G. ( 1 5, 1 4 ) (1 5, 1 5 ) ( 1 5, 1 4 ) (1 5, 1 5 ) ( 1 6, 1 3 ) ( 1 5, 1 4 ) ( 1 5, 1 4 ) (1 ( 6 1 6, 1 3 ), 1 3 ) d Ḡ ( 1 5, 1 4 ) (1 6, 1 3 ) d A(Ḡ) Figure 6 By routine lultions, we hve δ(,) = (12, 6), δ(,) = (5, 4), δ(,d) = (6, 3), δ(,) = (17, 10), δ(,d) = (6, 3), δ(,d) = (11, 7), e() = (12, 3), e() = (17, 3), e() = (17, 4), e(d) = (11, 3), d(g) = (17, 3).
12 108 muhmmd krm, sheng-gng li, k.p. shum Sine d(g) δ(x,y) for ll x, y V. Hene A(G) is n ntipodl ipolr fuzzy grph of G hving sme verties s in G only, nd no two verties in A(G) re mde s neighorhood sine their µ P µ N distne etween them is not equl to the dimeter of G. ( 1 5, 1 4 ) ( 1 5, 1 4 ) (1 5, 1 5 ) ( 1 5, 1 4 ) ( 1 5, 1 4 ) ( 1 6, 1 3 ) ( 1 6, 1 3 ) ( 1 5, 1 4 ) (1 6, 1 3 ) ( 1 6, 1 3 ) A(G) Figure 7 Clerly, A(G) is not isomorphi to A(G), though A(G) is isomorphi to A(G). Hene G is self omplementry ipolr fuzzy grph ut A(G) is not self omplementry ipolr fuzzy grph. We now present the onept of medin ipolr fuzzy grphs. Definition 3.14 Let G e onneted ipolr fuzzy grph. The µ P -sttus of vertex v i is denoted y S µ P(v i ) nd is defined s S µ P(v i ) = δ µ P(v i,v j ). d v j V The µ N -sttus of vertex v i is denoted y S µ N(v i ) nd is defined s S µ N(v i ) = δ µ N(v i,v j ). The minimum µ P -sttus of G is denoted y m[s µ P(G)] nd v j V is defined s m[s µ P(G)] = min(s µ P(v i ), v i V). The minimum µ N -sttus of G is denoted y m[s µ N(G)] nd is defined s m[s µ N(G)] = min(s µ N(v i ), v i V). The minimum µ P µ N sttus of G is denoted y m[s µ P µ N(G)] nd is defined s m[s µ P µ N(G)] = (m[s µ P(G)],m[S µ N(G)]). The mximum µp -sttus of G is denoted y M[S µ P(G)] nd is defined s M[S µ P(G)] = mx(s µ P(v i ), v i V). Themximumµ N -sttusofgisdenotedym[s µ N(G)]ndisdefineds M[S µ N(G)] = mx(s µ N(v i ), v i V). The mximum µ P µ N sttusof G isdenoted y M[S µ P µ N(G)] nd is defined s M[S µ P µ N(G)] = (M[S µ P(G)],M[S µ N(G)]). The totl µ P -sttus of ipolr fuzzy grph G is denoted y t[s µ P(G)] nd is defined s t[s µ P(G)] = S µ P(v i ). The totl µ N -sttus of ipolr fuzzy grph v i V G is denoted y t[s µ N(G)] nd is defined s t[s µ N(G)] = S µ N(v i ). The v i V totl µ N -sttus of ipolr fuzzy grph G is denoted y t[s µ P µ N(G)] nd is defined s t[s µ P µ N(G)] = (t[s µ P(G)],t[S µ N(G)]). The medin of ipolr fuzzy
13 ntipodl ipolr fuzzy grphs 109 grph G is denoted y M(G) nd is defined s the set of nodes with minimum µ P µ N sttus. An ipolr fuzzy grph G is sid to e self-medin if ll the verties hve the sme sttus. In other words, G is self-medin if nd only if m[s µ P µ N(G)] = M[S µ P µ N(G)]. Exmple 3.15 v 1 v 2 ( 1 3, 1 3 ) ( 1 2, 1 3 ) (1 3, 1 4 ) ( 1 3, 1 4 ) (1 3, 1 4 ) ( 1 2, 1 5 ) (1 2, 1 3 ) ( 1 3, 1 3 ) By routine lultions, we hve, v 4 v 3 Figure 8. Selfmedinipolrfuzzygrph. δ µ P(v 1,v 2 ) = 3, δ µ P(v 1,v 3 ) = 6, δ µ P(v 1,v 4 ) = 3, δ µ P(v 2,v 3 ) = 3, δ µ P(v 2,v 4 ) = 6, δ µ P(v 3,v 4 ) = 3, δ µ N(v 1,v 2 ) = 11, δ µ N(v 1,v 3 ) = 7, δ µ N(v 1,v 4 ) = 10, δ µ N(v 2,v 3 ) = 10, δ µ N(v 2,v 4 ) = 7, δ µ N(v 3,v 4 ) = 11, S µ P(v 1 ) = 12, S µ P(v 2 ) = 12, S µ P(v 3 ) = 12, S µ P(v 4 ) = 12, S µ N(v 1 ) = 28, S µ N(v 2 ) = 28, S µ N(v 3 ) = 28, S µ N(v 4 ) = 28. Therefore, S µ P µ N(v 1) = (12, 28), S µ P µ N(v 2) = (12, 28), S µ P µ N(v 3) = (12, 28), S µ P µ N(v 4) = (12, 28)ndt[S µ P µ N(G)] = (48, 112). Here,S µ P µ N(v i) = (12, 28), v i V. Hene G is self medin ipolr fuzzy grph. Theorem 3.15 Let G e ipolr fuzzy grph, where risp grph G is n even yle. If lternte edges hve sme positive vlues nd negtive vlues, then G is self medin ipolr fuzzy grph. Proof. Given tht G is ipolr fuzzy grph. Sine risp grph G is n even yle. Also, lternte edges of G hve sme positive vlues nd negtive vlues, we hve, δ(v 1,v 2 ) = δ(v 3,v 4 ) = δ(v 1,v 2 ) =... = δ(v n 1,v n ) nd, similrly, δ(v 2,v 3 ) = δ(v 4,v 5 ) =... = δ(v n,v 1 ), δ(v 1,v 3 ) = δ(v 2,v 4 ) = δ(v 3,v 5 ) =... = l, so on. Hene S µ P(v i ) = k nd S µ N(v i ) = m, v i V. Hene G is self medin ipolr fuzzy grph. Remrk 2 Let G e ipolr fuzzy grph, where risp grph G is n odd yle. If lternte edges hve sme positive nd negtive vlues, then G my not e self medin ipolr fuzzy grph.
14 110 muhmmd krm, sheng-gng li, k.p. shum Referenes [1] Akrm, M., Bipolr fuzzy grphs, Informtion Sienes, 181 (2011), [2] Akrm, M. nd Dudek, W.A., Regulr ipolr fuzzy grphs, Neurl Computing & Applitions, 21, (2012), [3] Akrm, M. nd Krunmigi, M.G., Metri in ipolr fuzzy grphs, World Applied Sienes Journl, 14 (2011), [4] Akrm, M., Seid, A.B., Shum, K.P. nd Meng, B.L., Bipolr fuzzy K-lgers, Interntionl Journl of Fuzzy System, 10 (3) (2010, [5] Atnssov, K.T., Intuitionisti fuzzy sets: Theory nd pplitions, Studies in fuzziness nd soft omputing, Heidelerg, New York, Physi-Verl., [6] Ahry, B.D. nd Ahry, M., On self-ntipodl grphs, Nt. Ad. Si. Lett., 8 (1985), [7] Ahmed, B. nd Gni, A.N., Perfet Fuzzy Grphs, Bulletin of Pure nd Applied Sienes, 28 (2009), [8] Arvmudhn, R. nd Rjendrn, B., On ntipodl grphs, Disrete Mth., 49 (1984), [9] Bhtthry, P., Some remrks on fuzzy grphs, Pttern Reognition Letter, 6 (1987), [10] Gni, A.N., nd Mlrvizhi, J., On ntipodl fuzzy grph, Applied Mthemtil Sienes, 4 (43) (2010), [11] Kuffmn, A., Introdution l Theorie des Sous-emsemles Flous, Msson et Cie, vol. 1, [12] Mordeson, J.N. nd Nir, P.S., Fuzzy grphs nd fuzzy hypergrphs, Physi Verlg, Heidelerg 1998; Seond Edition [13] Rosenfeld, A., Fuzzy grphs, Fuzzy Sets nd Their Applitions (L.A. Zdeh, K.S. Fu, M. Shimur, Eds.), Ademi Press, New York, 1975, [14] Shnnon, A., Atnssov, K.T., A first step to theory of the intuitionisti fuzzy grphs, Proeeding of FUBEST (D. Lkov, Ed.), Sofi, 1994, [15] Sunith, M.S. nd Vijykumr, A., Complement of fuzzy grph, Indin Journl of Pure nd Applied Mthemtis, 33 (9), [16] Yng, H.-L., Li, S.-G., Guo, Z.-L., M, C.-H., Trnsformtion of ipolr fuzzy rough set models, Knowl.Bsed Syst., 27 (2012), [17] Zdeh, L.A., Fuzzy sets, Informtion nd Control, 8 (1965), [18] Zdeh, L.A., Similrity reltions nd fuzzy orderings, Informtion Sienes, 3 (2) (1971), [19] Zhng, W.-R., Bipolr fuzzy sets nd reltions: omputtionl frmework forognitive modeling nd multigent deision nlysis, Pro. of IEEE Conf., 1994, [20] Zhng, W.-R., Bipolr fuzzy sets, Pro. of FUZZ-IEEE, 1998, Aepted:
On Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras
Glol Journl of Mthemtil Sienes: Theory nd Prtil. ISSN 974-32 Volume 9, Numer 3 (27), pp. 387-397 Interntionl Reserh Pulition House http://www.irphouse.om On Implitive nd Strong Implitive Filters of Lttie
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationA Study on the Properties of Rational Triangles
Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn
More informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More informationGraph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}
Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)
More informationMid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours
Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into
More informationCS 491G Combinatorial Optimization Lecture Notes
CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More informationApril 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.
pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm
More informationCHENG Chun Chor Litwin The Hong Kong Institute of Education
PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using
More informationSection 1.3 Triangles
Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationExercise sheet 6: Solutions
Eerise sheet 6: Solutions Cvet emptor: These re merel etended hints, rther thn omplete solutions. 1. If grph G hs hromti numer k > 1, prove tht its verte set n e prtitioned into two nonempt sets V 1 nd
More informationON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups. Sang Keun Lee
Kngweon-Kyungki Mth. Jour. 10 (2002), No. 2, pp. 117 122 ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups Sng Keun Lee Astrt. In this pper, we give some properties of left(right) semi-regulr nd g-regulr
More informationReceived: 29 November 2018; Accepted: 12 January 2019; Published: 16 January 2019
mthemtis Artile q-rung Orthopir Fuzzy Competition Grphs with Applition in the Soil Eosystem Amn Hi 1 Muhmmd Akrm 1 * nd Adeel Frooq 2 1 Deprtment of Mthemtis University of the Punj New Cmpus Lhore 54590
More informationTechnische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution
Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:
More informationCIT 596 Theory of Computation 1. Graphs and Digraphs
CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege
More informationLinear choosability of graphs
Liner hoosility of grphs Louis Esperet, Mikel Montssier, André Rspud To ite this version: Louis Esperet, Mikel Montssier, André Rspud. Liner hoosility of grphs. Stefn Felsner. 2005 Europen Conferene on
More information#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS
#A42 INTEGERS 11 (2011 ON THE CONDITIONED BINOMIAL COEFFICIENTS Liqun To Shool of Mthemtil Sienes, Luoyng Norml University, Luoyng, Chin lqto@lynuedun Reeived: 12/24/10, Revised: 5/11/11, Aepted: 5/16/11,
More informationQUADRATIC EQUATION. Contents
QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,
More informationCo-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities
Int. J. Contemp. Mth. Sienes, Vol. 3, 008, no. 3, 557-567 Co-ordinted s-convex Funtion in the First Sense with Some Hdmrd-Type Inequlities Mohmmd Alomri nd Mslin Drus Shool o Mthemtil Sienes Fulty o Siene
More informationPAIR OF LINEAR EQUATIONS IN TWO VARIABLES
PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,
More informationIntroduction to Olympiad Inequalities
Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................
More informationPOSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS
Bull. Koren Mth. So. 35 (998), No., pp. 53 6 POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS YOUNG BAE JUN*, YANG XU AND KEYUN QIN ABSTRACT. We introue the onepts of positive
More informationIntermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths
Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t
More informationLesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.
27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we
More informationLinear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
More informationHyers-Ulam stability of Pielou logistic difference equation
vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo
More informationPart 4. Integration (with Proofs)
Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1
More informationFinite State Automata and Determinisation
Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions
More informationProbability. b a b. a b 32.
Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,
More information( ) { } [ ] { } [ ) { } ( ] { }
Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or
More informationFirst Midterm Examination
24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
More informationLIP. Laboratoire de l Informatique du Parallélisme. Ecole Normale Supérieure de Lyon
LIP Lortoire de l Informtique du Prllélisme Eole Normle Supérieure de Lyon Institut IMAG Unité de reherhe ssoiée u CNRS n 1398 One-wy Cellulr Automt on Cyley Grphs Zsuzsnn Rok Mrs 1993 Reserh Report N
More informationGreedoid polynomial, chip-firing, and G-parking function for directed graphs. Connections in Discrete Mathematics
Greedoid polynomil, hip-firing, nd G-prking funtion for direted grphs Swee Hong Chn Cornell University Connetions in Disrete Mthemtis June 15, 2015 Motivtion Tutte polynomil [Tut54] is polynomil defined
More informationQUADRATIC EQUATION EXERCISE - 01 CHECK YOUR GRASP
QUADRATIC EQUATION EXERCISE - 0 CHECK YOUR GRASP. Sine sum of oeffiients 0. Hint : It's one root is nd other root is 8 nd 5 5. tn other root 9. q 4p 0 q p q p, q 4 p,,, 4 Hene 7 vlues of (p, q) 7 equtions
More informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
More informationA Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version
A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment
More informationSEMI-EXCIRCLE OF QUADRILATERAL
JP Journl of Mthemtil Sienes Volume 5, Issue &, 05, Pges - 05 Ishn Pulishing House This pper is ville online t http://wwwiphsiom SEMI-EXCIRCLE OF QUADRILATERAL MASHADI, SRI GEMAWATI, HASRIATI AND HESY
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More informationArrow s Impossibility Theorem
Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep
More informationSOME COPLANAR POINTS IN TETRAHEDRON
Journl of Pure n Applie Mthemtis: Avnes n Applitions Volume 16, Numer 2, 2016, Pges 109-114 Aville t http://sientifivnes.o.in DOI: http://x.oi.org/10.18642/jpm_7100121752 SOME COPLANAR POINTS IN TETRAHEDRON
More informationm m m m m m m m P m P m ( ) m m P( ) ( ). The o-ordinte of the point P( ) dividing the line segment joining the two points ( ) nd ( ) eternll in the r
CO-ORDINTE GEOMETR II I Qudrnt Qudrnt (-.+) (++) X X - - - 0 - III IV Qudrnt - Qudrnt (--) - (+-) Region CRTESIN CO-ORDINTE SSTEM : Retngulr Co-ordinte Sstem : Let X' OX nd 'O e two mutull perpendiulr
More informationApplications of Definite Integral
Chpter 5 Applitions of Definite Integrl 5.1 Are Between Two Curves In this setion we use integrls to find res of regions tht lie between the grphs of two funtions. Consider the region tht lies between
More informationApplications of Definite Integral
Chpter 5 Applitions of Definite Integrl 5.1 Are Between Two Curves In this setion we use integrls to find res of regions tht lie between the grphs of two funtions. Consider the region tht lies between
More informationDorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000
orf, R.C., Wn,. T- Equivlent Networks The Eletril Engineering Hndook Ed. Rihrd C. orf Bo Rton: CRC Press LLC, 000 9 T P Equivlent Networks hen Wn University of Cliforni, vis Rihrd C. orf University of
More informationSection 4.4. Green s Theorem
The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls
More informationANALYSIS AND MODELLING OF RAINFALL EVENTS
Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.
More informationBisimulation, Games & Hennessy Milner logic
Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory
More information= state, a = reading and q j
4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those
More informationDescriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
Desriptionl Complexity of Non-Unry Self-Verifying Symmetri Differene Automt Lurette Mris 1,2 nd Lynette vn Zijl 1 1 Deprtment of Computer Siene, Stellenosh University, South Afri 2 Merk Institute, CSIR,
More informationComparing the Pre-image and Image of a Dilation
hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity
More informationGraph States EPIT Mehdi Mhalla (Calgary, Canada) Simon Perdrix (Grenoble, France)
Grph Sttes EPIT 2005 Mehdi Mhll (Clgry, Cnd) Simon Perdrix (Grenole, Frne) simon.perdrix@img.fr Grph Stte: Introdution A grph-sed representtion of the entnglement of some (lrge) quntum stte. Verties: quits
More informationPrefix-Free Regular-Expression Matching
Prefix-Free Regulr-Expression Mthing Yo-Su Hn, Yjun Wng nd Derik Wood Deprtment of Computer Siene HKUST Prefix-Free Regulr-Expression Mthing p.1/15 Pttern Mthing Given pttern P nd text T, find ll sustrings
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationLecture 6: Coding theory
Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those
More informationHamiltonian Cycle in Complete Multipartite Graphs
Annls of Pure nd Applied Mthemtics Vol 13, No 2, 2017, 223-228 ISSN: 2279-087X (P), 2279-0888(online) Pulished on 18 April 2017 wwwreserchmthsciorg DOI: http://dxdoiorg/1022457/pmv13n28 Annls of Hmiltonin
More informationAlgorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:
Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer
More informationActivities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions
MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd
More informationSystem Validation (IN4387) November 2, 2012, 14:00-17:00
System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise
More informationNondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
More informationArrow s Impossibility Theorem
Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties
More informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationOn a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
Journl of Grph Algorithms n Applitions http://jg.info/ vol. 13, no. 2, pp. 153 177 (2009) On Clss of Plnr Grphs with Stright-Line Gri Drwings on Liner Are M. Rezul Krim 1,2 M. Siur Rhmn 1 1 Deprtment of
More informationAP Calculus AB Unit 4 Assessment
Clss: Dte: 0-04 AP Clulus AB Unit 4 Assessment Multiple Choie Identify the hoie tht best ompletes the sttement or nswers the question. A lultor my NOT be used on this prt of the exm. (6 minutes). The slope
More informationSymmetrical Components 1
Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent
More informationFunctions. mjarrar Watch this lecture and download the slides
9/6/7 Mustf Jrrr: Leture Notes in Disrete Mthemtis. Birzeit University Plestine 05 Funtions 7.. Introdution to Funtions 7. One-to-One Onto Inverse funtions mjrrr 05 Wth this leture nd downlod the slides
More informationMatrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24
Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the
More informationarxiv: v1 [math.ca] 21 Aug 2018
rxiv:1808.07159v1 [mth.ca] 1 Aug 018 Clulus on Dul Rel Numbers Keqin Liu Deprtment of Mthemtis The University of British Columbi Vnouver, BC Cnd, V6T 1Z Augest, 018 Abstrt We present the bsi theory of
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS
The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their
More information, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.
Exerise Genertor polynomils of onvolutionl ode, given in binry form, re g, g j g. ) Sketh the enoding iruit. b) Sketh the stte digrm. ) Find the trnsfer funtion T. d) Wht is the minimum free distne of
More informationExercise 3 Logic Control
Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled
More information8 THREE PHASE A.C. CIRCUITS
8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),
More informationRandom subgroups of a free group
Rndom sugroups of free group Frédérique Bssino LIPN - Lortoire d Informtique de Pris Nord, Université Pris 13 - CNRS Joint work with Armndo Mrtino, Cyril Nicud, Enric Ventur et Pscl Weil LIX My, 2015 Introduction
More informationEngr354: Digital Logic Circuits
Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost
More information6.5 Improper integrals
Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =
More informationLESSON 11: TRIANGLE FORMULAE
. THE SEMIPERIMETER OF TRINGLE LESSON : TRINGLE FORMULE In wht follows, will hve sides, nd, nd these will e opposite ngles, nd respetively. y the tringle inequlity, nd..() So ll of, & re positive rel numers.
More informationReflection Property of a Hyperbola
Refletion Propert of Hperol Prefe The purpose of this pper is to prove nltill nd to illustrte geometrill the propert of hperol wherein r whih emntes outside the onvit of the hperol, tht is, etween the
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
More informationChapter 8 Roots and Radicals
Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi
More informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,
More informationf (x)dx = f(b) f(a). a b f (x)dx is the limit of sums
Green s Theorem If f is funtion of one vrible x with derivtive f x) or df dx to the Fundmentl Theorem of lulus, nd [, b] is given intervl then, ording This is not trivil result, onsidering tht b b f x)dx
More informationMatrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix
tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationIntuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras
Intuitionistic Fuzzy Lttices nd Intuitionistic Fuzzy oolen Algebrs.K. Tripthy #1, M.K. Stpthy *2 nd P.K.Choudhury ##3 # School of Computing Science nd Engineering VIT University Vellore-632014, TN, Indi
More informationKENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations)
KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS 6-7 CLASS - XII MATHEMATICS (Reltions nd Funtions & Binry Opertions) For Slow Lerners: - A Reltion is sid to e Reflexive if.. every A
More informationON THE INEQUALITY OF THE DIFFERENCE OF TWO INTEGRAL MEANS AND APPLICATIONS FOR PDFs
ON THE INEQUALITY OF THE DIFFERENCE OF TWO INTEGRAL MEANS AND APPLICATIONS FOR PDFs A.I. KECHRINIOTIS AND N.D. ASSIMAKIS Deprtment of Eletronis Tehnologil Edutionl Institute of Lmi, Greee EMil: {kehrin,
More informationOn the Spectra of Bipartite Directed Subgraphs of K 4
On the Spetr of Biprtite Direte Sugrphs of K 4 R. C. Bunge, 1 S. I. El-Znti, 1, H. J. Fry, 1 K. S. Kruss, 2 D. P. Roerts, 3 C. A. Sullivn, 4 A. A. Unsiker, 5 N. E. Witt 6 1 Illinois Stte University, Norml,
More informationCore 2 Logarithms and exponentials. Section 1: Introduction to logarithms
Core Logrithms nd eponentils Setion : Introdution to logrithms Notes nd Emples These notes ontin subsetions on Indies nd logrithms The lws of logrithms Eponentil funtions This is n emple resoure from MEI
More informationFigure 1. The left-handed and right-handed trefoils
The Knot Group A knot is n emedding of the irle into R 3 (or S 3 ), k : S 1 R 3. We shll ssume our knots re tme, mening the emedding n e extended to solid torus, K : S 1 D 2 R 3. The imge is lled tuulr
More information1.3 SCALARS AND VECTORS
Bridge Course Phy I PUC 24 1.3 SCLRS ND VECTORS Introdution: Physis is the study of nturl phenomen. The study of ny nturl phenomenon involves mesurements. For exmple, the distne etween the plnet erth nd
More informationChapter 3. Vector Spaces. 3.1 Images and Image Arithmetic
Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner
More informationNON-DETERMINISTIC FSA
Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationSOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVEX STOCHASTIC PROCESSES ON THE CO-ORDINATES
Avne Mth Moels & Applitions Vol3 No 8 pp63-75 SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVE STOCHASTIC PROCESSES ON THE CO-ORDINATES Nurgül Okur * Imt Işn Yusuf Ust 3 3 Giresun University Deprtment
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationOn the Co-Ordinated Convex Functions
Appl. Mth. In. Si. 8, No. 3, 085-0 0 085 Applied Mthemtis & Inormtion Sienes An Interntionl Journl http://.doi.org/0.785/mis/08038 On the Co-Ordinted Convex Funtions M. Emin Özdemir, Çetin Yıldız, nd Ahmet
More information