INTUITIONISTIC FUZZY GRAPH STRUCTURES
|
|
- Arthur Edwards
- 6 years ago
- Views:
Transcription
1 Kragujevac Journal of Mathematcs Volume 41(2) (2017), Pages INTUITIONISTIC FUZZY GRAPH STRUCTURES MUHAMMAD AKRAM 1 AND RABIA AKMAL 2 Abstract. In ths paper, we ntroduce the concept of an ntutonstc fuzzy graph structure (IFGS). We dscuss certan notons, ncludng ntutonstc fuzzy B -cycles, ntutonstc fuzzy B -trees and φ-complement of an ntutonstc fuzzy graph structure wth several examples. We also present φ-complement of an ntutonstc fuzzy graph structure along wth self-complementary and strong self-complementary ntutonstc fuzzy graph structures. 1. Introducton Fuzzy set was ntroduced by Zadeh n A fuzzy set gves the degree of membershp of an object n a gven set. Kaufmann s ntal defnton of a fuzzy graph [10] was based on Zadeh s fuzzy relatons [22]. The fuzzy relatons between fuzzy sets were consdered by Rosenfeld and he developed the structure of fuzzy graphs, obtanng analogs of several graph theoretcal concepts. Later on, Bhattacharya [7] gave some remarks on fuzzy graphs and some operatons on fuzzy graphs were ntroduced by Mordeson and Peng [14]. In 1983, Atanassov [5] extended the dea of a fuzzy set and ntroduced the concept of an ntutonstc fuzzy set. He added a new component, degree of non-membershp, n the defnton of a fuzzy set wth the condton that sum of two degrees must be less or equal to one. Atanassov [6] also ntroduced the concept of ntutonstc fuzzy graphs and ntutonstc fuzzy relatons. Shannon and Atanassov nvestgated some propertes of ntutonstc fuzzy relatons and ntutonstc fuzzy graphs n [20]. Parvath et al. defned operatons on ntutonstc fuzzy graphs n [16]. Karunambga et al. used ntutonstc fuzzy graphs to fnd shortest paths n networks [11]. Akram et al. [1 4] ntroduced many Key words and phrases. Intutonstc fuzzy graph structure (IFGS), strong IFGS, Intutonstc fuzzy B -cycles, Intutonstc fuzzy B -trees, φ-complement of an IFGS Mathematcs Subject Classfcaton. Prmary: 05C72, 68R10. Secondary: 03E72, 05C78. Receved: September 5, Accepted: September 12,
2 220 M. AKRAM AND R. AKMAL new concepts, ncludng strong ntutonstc fuzzy graphs, ntutonstc fuzzy trees, ntutonstc fuzzy hypergraphs, and ntutonstc fuzzy dgraphs n decson support systems. Fuzzy graph theory s fndng an ncreasng number of applcatons n modelng real tme systems where the level of nformaton nherent n the system vares wth dfferent levels of precson. Fuzzy models are becomng useful because of ther am n reducng the dfferences between the tradtonal numercal models used n engneerng and scences and the symbolc models used n expert systems. Intutonstc fuzzy set has got an advantage over fuzzy set because of ts addtonal component whch explans the defcency of knowledge n assgnng the degree of membershp to an object because there s a far chance of the exstence of a non-zero hestaton part at each moment of evaluaton of anythng. The advantages of ntutonstc fuzzy sets and graphs are that they gve more accuracy nto the problems, reduce the cost of mplementaton and mprove effcency. Intutonstc fuzzy sets are very useful n provdng a flexble model to descrbe uncertanty and vagueness nvolved n decson makng, so ntutonstc fuzzy graphs are playng a substantal role n chemstry, economcs, computer scences, engneerng, medcne and decson makng problems, now a days. Graph structures or generalzed graph structures ntroduced by Sampathkumar n 2006 [19], are a generalzaton of graphs whch s qute useful n studyng sgned graphs and graphs n whch every edge s labeled or colored because they help to study varous relatons and correspondng edges smultaneously. Dnesh and Ramakrshnan [9] ntroduced fuzzy graph structures. In ths paper, we have worked on ntutonstc fuzzy graph structures, some of ther fundamental concepts and propertes due to the mproved nfluence of ntutonstc fuzzy sets and partcular use of graph structures. In ths paper, we ntroduce the concept of an ntutonstc fuzzy graph structure (IFGS). We dscuss certan notons, ncludng ntutonstc fuzzy B -cycles, ntutonstc fuzzy B -trees and φ-complement of an ntutonstc fuzzy graph structure wth several examples. We also present φ-complement of an ntutonstc fuzzy graph structure along wth self-complementary and strong self-complementary ntutonstc fuzzy graph structures. 2. Prelmnares We frst revew some defntons from [19] that are necessary for ths paper. A graph structure G = (U, E 1, E 2,..., E k ), conssts of a non-empty set U together wth relatons E 1, E 2,..., E k on U, whch are mutually dsjont such that each E s rreflexve and symmetrc. If (u, v) E for some, 1 k, we call t an E -edge and wrte t as uv. A graph structure G = (U, E 1, E 2,..., E k ) s complete, f () each edge E, 1 k appears at least once n G ; () between each par of vertces uv n U, uv s an E -edge for some, 1 k. A graph structure G = (U, E 1, E 2,..., E k ) s connected, f the underlyng graph s connected. In a graph structure, E -path between two vertces u and v, s the path
3 INTUITIONISTIC FUZZY GRAPH STRUCTURES 221 whch conssts of only E -edges for some, and smlarly, E -cycle s the cycle, whch conssts of only E -edges for some. A graph structure s a tree, f t s connected and contans no cycle or equvalently the underlyng graph of G s a tree. G s an E -tree, f the subgraph structure nduced by E-edges s a tree. Smlarly, G s a E 1 E 2... E k -tree, f G s a E j -tree for each j, 1 j k. A graph structure s an E -forest, f the subgraph structure nduced by E -edges s a forest,.e., f t has no E -cycles. Let S U, then the subgraph structure S nduced by S, has vertex set S, where two vertces u and v n S are joned by an E -edge f, and only f, they are joned by an E -edge n G for 1 k For some, 1 k, the E -subgraph nduced by S, s denoted by E - S and t has only E -edges jonng the vertces n S. If T s a subset of edge set n G, then subgraph structure T nduced by T has the vertex set, the end vertces n T, and whose edges are those n T. Let G = (U 1, E 1, E 2,..., E m ) and H = (U 2, E 1, E 2,..., E n) be graph structures then G and H are somorphc, f m = n and there exsts a bjecton f : U 1 U 2 and a permutaton φ : {E 1, E 2,..., E n } {E 1, E 2,..., E n}, say E E j, 1, j n, such that for all u, v U 1, uv E mples f(u)f(v) E j. Two graph structures G = (U, E 1, E 2,..., E k ) and H = (U, E 1, E 2,..., E k ), on the same vertex set U, are dentcal, f there exsts a bjecton f : U U, such that for all u and v n U and an E -edge uv n G, f(u)f(v) s an E -edge n H, where 1 k and E E for all. Let φ be a permutaton on {E 1, E 2,..., E k } then the φ-cyclc complement of G denoted by (G ) φc s obtaned by replacng E wth φ(e ) for 1 k. Let G = (U, E 1, E 2,..., E k ) be a graph structure and φ be a permutaton on {E 1, E 2,..., E k }, then G s φ-self complementary, f G s somorphc to (G ) φc, the φ-cyclc complement of G and G s self-complementary, f φ dentty permutaton; G s strong φ-self complementary, f G s dentcal to (G ) φc, the φ-complement of G and G s strong self-complementary, f φ dentty permutaton. Defnton 2.1 ([6]). An ntutonstc fuzzy set (IFS) on an unverse X s an object of the form A = { x, µ A (x), ν A (x) x X}, where µ A (x)( [0, 1]) s called degree of membershp of x A, ν A (x)( [0, 1]) s called degree of nonmembershp of x A, and µ A and ν A satsfy the followng condton: for all x X, µ A (x) + ν A (x) 1. Defnton 2.2 ([6]). An ntutonstc fuzzy relaton R = (µ R (x, y), ν R (x, y)) n an unverse X Y (R(X Y )) s an ntutonstc fuzzy set of the form R = { (x, y), µ R (x, y), ν R (x, y) (x, y) X Y }, where µ R : X Y [0, 1] and ν R : X Y [0, 1]. The ntutonstc fuzzy relaton R satsfes µ R (x, y) + ν R (x, y) 1 for all x, y X.
4 222 M. AKRAM AND R. AKMAL Defnton 2.3 ([9]). Let G = (U, E 1, E 2,..., E k ) be a graph structure and ν, ρ 1, ρ 2,..., ρ k be the fuzzy subsets of U, E 1, E 2,..., E k, respectvely such that 0 ρ (xy) ν(x) ν(y), for all x, y U and = 1, 2,..., k. Then G = (ν, ρ 1, ρ 2,..., ρ k ) s a fuzzy graph structure of G. Defnton 2.4 ([9]). Let G = (ν, ρ 1, ρ 2,..., ρ k ) be a fuzzy graph structure of a graph structure G = (U, E 1, E 2,..., E k ). Then F = (ν, τ 1, τ 2,..., τ k ) s a partal fuzzy spannng subgraph structure of G f, τ ρ for = 1, 2,..., k. Defnton 2.5 ([9]). Let G be a graph structure and G be a fuzzy graph structure of G. If xy supp(ρ ), then xy s sad to be a ρ -edge of G. Defnton 2.6 ([9]). The strength of a ρ -path x 0 x 1... x n of a fuzzy graph structure G s n j=1 ρ (x j 1 x j ) for = 1, 2,..., k. Defnton 2.7 ([9]). In any fuzzy graph structure G, ρ 2 (xy) = ρ ρ (xy) = z {ρ (xz) ρ (zy)}, ρ j (xy) = (ρj 1 ρ )(xy) = z { ρ j 1 (xz) ρ (zy) }, j = 2, 3,..., m, for any m 2. Also ρ (xy) = { ρ j (xy), j = 1, 2,... }. Defnton 2.8 ([9]). G = (ν, ρ 1, ρ 2,..., ρ k ) s a ρ -cycle ff (supp(ν), supp(ρ 1 ), supp(ρ 2 ),..., supp(ρ k )) s a E -cycle. Defnton 2.9 ([9]). G = (ν, ρ 1, ρ 2,..., ρ k ) s a fuzzy ρ -cycle ff (supp(ν), supp(ρ 1 ), supp(ρ 2 ),..., supp(ρ k )) s a E -cycle and there exsts no unque xy n supp(ρ ) such that ρ (xy) = {ρ )(uv) uv supp(ρ )}. Defnton 2.10 ([9]). G = (ν, ρ 1, ρ 2,..., ρ k ) s a fuzzy ρ -tree f t has a partal fuzzy spannng subgraph structure, F = (ν, τ 1, τ 2,..., τ k ) whch s a τ -tree where for all ρ -edges not n F, ρ (xy) < τ (xy). 3. Intutonstc Fuzzy Graph Structures Defnton 3.1. Let {E : = 1, 2,..., n} be a set of rreflexve, symmetrc and mutually dsjont relatons on a non-empty set U. An ntutonstc fuzzy graph structure (IFGS) wth underlyng vertex set U s denoted by Ğs = (A, B 1, B 2,..., B n ), where () A s an ntutonstc fuzzy set of U wth µ A : U [0, 1] and ν A : U [0, 1], namely the degree of membershp and the degree of nonmembershp of x U, respectvely, such that 0 µ A (x) + ν A (x) 1, for all x U.
5 INTUITIONISTIC FUZZY GRAPH STRUCTURES 223 () Each B s an ntutonstc fuzzy set of E such that the functons µ B : E [0, 1] and ν B : E [0, 1] are defned by and µ B (xy) µ A (x) µ A (y), ν B (xy) ν A (x) ν A (y) 0 µ B (xy) + ν B (xy) 1, for all xy U U, = 1, 2,..., n. Equvalently, an IFGS of a graph structure may be defned n the followng way. Let G = (U, E 1, E 2,..., E n ) be a graph structure and let A, B 1, B 2,..., B n 1 andb n be ntutonstc fuzzy subsets of U, E 1, E 2,..., E n 1 and E n, respectvely. Then Ğ s = (A, B 1, B 2,..., B n ) s called an IFGS of G, f µ B (xy) µ A (x) µ A (y), ν B (xy) ν A (x) ν A (y), for all xy E, = 1, 2,..., n, and µ B (xy) + ν B (xy) 1, for all xy U U. Example 3.1. Let G = (U, E 1, E 2 ) be a graph structure such that U = {a 1, a 2, a 3, a 4 }, E 1 = {a 1 a 2, a 2 a 3 } and E 2 = {a 3 a 4, a 1 a 4 }. Let A, B 1 andb 2 be ntutonstc fuzzy subsets of U, E 1 and E 2, respectvely, such that A = {(a 1, 0.5, 0.2), (a 2, 0.7, 0.3), (a 3, 0.4, 0.3), (a 4, 0.7, 0.3)}, B 1 = {(a 1 a 2, 0.5, 0.3), (a 2 a 3, 0.4, 0.3)}, and B 2 = {(a 3 a 4, 0.4, 0.3), (a 1 a 4, 0.1, 0.2)}. Then Ğs = (A, B 1, B 2 ) s an IFGS of G as shown n Fg. 1. Fgure 1. IFGS Ğs = (A, B 1, B 2 ) Defnton 3.2. An IFGS H s = (C, D 1, D 2,..., D n ) s sad to be an ntutonstc fuzzy subgraph structure of an IFGS Ğs = (A, B 1, B 2,..., B n ) wth underlyng vertex set U, f C A and D C for all, that s µ C (x) µ A (x), ν C (x) ν A (x), for all x U,
6 224 M. AKRAM AND R. AKMAL and for = 1, 2,..., n µ D (xy) µ B (xy), ν D (xy) ν B (xy), for all xy U U. H s s called an ntutonstc fuzzy spannng subgraph structure of an IFGS Ğs, f C = A. H s s called an ntutonstc fuzzy partal spannng subgraph structure of an IFGS Ğ s, f t excludes some edges of Ğ s. s s P s Fgure 2. Intutonstc Fuzzy Subgraph Structures Example 3.2. Consder an IFGS Ğs = (A, B 1, B 2 ), as shown n Fg. 1. Let C = {(a 1, 0.4, 0.4), (a 2, 0.0, 0.4), (a 3, 0.4, 0.3), (a 4, 0.6, 0.4)}, D 1 = {(a 1 a 2, 0, 0.4), (a 2 a 3, 0, 0.4)}, D 2 = {(a 3 a 4, 0.3, 0.4), (a 1 a 4, 0.1, 0.4)},
7 INTUITIONISTIC FUZZY GRAPH STRUCTURES 225 C 1 = {(a 1 a 2, 0.3, 0.3), (a 2 a 3, 0.4, 0.3)}, C 2 = {(a 3 a 4, 0.3, 0.3), (a 1 a 4, 0.1, 0.3)}, F 1 = {(a 1 a 2, 0.5, 0.3), (a 2 a 3, 0.4, 0.3)}, and F 2 = {(a 1 a 4, 0.1, 0.3)}. By routne calculatons, t s easy to see that H s = (C, D 1, D 2 ), J s = (A, C 1, C 2 ) and K s = (A, F 1, F 2 ) are respectvely the ntutonstc fuzzy subgraph structure, ntutonstc fuzzy spannng subgraph structure and ntutonstc fuzzy partal spannng subgraph structure of Ğ s. Ther respectve drawngs are shown n Fg. 2. Defnton 3.3. Let Ğs = (A, B 1, B 2,..., B n ) be an IFGS wth underlyng vertex set U. Then there s a B -edge between two vertces x and y of U, f one of the followng s true: () µ B (xy) > 0 and ν B (xy) > 0, () µ B (xy) > 0 and ν B (xy) = 0, () µ B (xy) = 0 and ν B (xy) > 0, for some. Defnton 3.4. For an ntutonstc fuzzy graph structure Ğs = (A, B 1, B 2,..., B n ) wth vertex set U, support of B s gven by: supp(b ) = {xy U U : µ B (xy) 0 or ν B (xy) 0}, = 1, 2,..., n. Defnton 3.5. B -path of an IFGS Ğs = (A, B 1, B 2,..., B n ) wth underlyng vertex set U, s a sequence of dstnct vertces v 1, v 2,..., v m U (except the choce v m = v 1 ), such that v j 1 v j s a B -edge for all j = 2, 3,..., m. Defnton 3.6. In an IFGS Ğs = (A, B 1, B 2,..., B n ) wth underlyng vertex set U, two vertces x and y of U are sad to be B -connected, f they are joned by a B -Path, for some {1, 2, 3,..., n}. Defnton 3.7. An IFGS Ğs = (A, B 1, B 2,..., B n ) wth underlyng vertex set U, s sad to be B -strong, f for all B -edges xy for some {1, 2, 3,..., n}. µ B (xy) = µ A (x) µ A (y), ν B (xy) = ν A (x) ν A (y), Example 3.3. Consder the IFGS Ğs = (A, B 1, B 2 ), as shown n Fg. 1. Then () a 1 a 2, a 2 a 3 are B 1 -edges and a 3 a 4, a 1 a 4 are B 2 -edges; () a 1 a 2 a 3 and a 3 a 4 a 1 are B 1 - and B 2 -paths, respectvely; () a 1 and a 3 are B 1 -connected vertces of U; (v) Ğs s B 1 -strong, snce supp(b 1 ) = {a 1 a 2, a 2 a 3 } and µ B1 (a 1 a 2 ) = 0.5 = (µ A (a 1 ) µ A (a 2 )), ν B1 (a 1 a 2 ) = 0.3 = (ν A (a 1 ) ν A (a 2 )),
8 226 M. AKRAM AND R. AKMAL µ B1 (a 2 a 3 ) = 0.4 = (µ A (a 2 ) µ A (a 3 )), and ν B1 (a 2 a 3 ) = 0.3 = (ν A (a 2 ) ν A (a 3 )). Defnton 3.8. An IFGS Ğs = (A, B 1, B 2,..., B n ) s sad to be strong, f t s B -strong for all {1, 2, 3,..., n}. Defnton 3.9. An IFGS Ğs = (A, B 1, B 2,..., B n ) wth underlyng vertex set U, s called complete or B 1 B 2... B n -complete f () Ğs s a strong IFGS; () supp(b ) for all = 1, 2, 3,..., n; () For each par of vertces x, y U, xy s a B -edge for some. Example 3.4. Let Ğs = (A, B 1, B 2 ) shown n Fg. 3, be IFGS of the graph structure G = (U, E 1, E 2 ) where U = {a 1, a 2, a 3, a 4 }, E 1 = {a 1 a 3, a 3 a 4, a 1 a 4 } and E 2 = {a 1 a 2, a 2 a 3, a 2 a 4 }. Then Ğs s a strong IFGS snce t s both B 1 -strong and B 2 -strong. Fgure 3. IFGS Ğs = (A, B 1, B 2 ) Moreover supp(b 1 ), supp(b 2 ), every par of vertces belongng to U, s ether a B 1 -edge or a B 2 -edge, so Ğs s a complete or B 1 B 2 -complete IFGS as well. Defnton In an IFGS Ğs = (A, B 1, B 2,..., B n ) wth underlyng vertex set U, µ B - and ν B -strengths of a B -path B P = v 1 v 2... v m, are denoted by B δ.p and B.P, respectvely, such that m m B δ.p = [µ B (v j 1 v j )] and B.P = [ν B (v j 1 v j )]. j=2 Then we wrte, strength of the path P B = (δ.p B,.P B ). Example 3.5. In Ğs = (A, B 1, B 2 ) shown n Fg. 3, P 1 = a 1 a 3 a 4 a 1 s a B 1 -path and P 2 = a 3 a 2 a 4 s a B 2 -path and δ.p 1 = µ B1 (a 1 a 3 ) µ B1 (a 3 a 4 ) µ B1 (a 4 a 1 ) = = 0.2, j=2
9 INTUITIONISTIC FUZZY GRAPH STRUCTURES 227.P 1 = ν B1 (a 1 a 3 ) ν B1 (a 3 a 4 ) ν B1 (a 4 a 1 ) = = 0.6, δ.p 2 = µ B2 (a 3 a 2 ) µ B2 (a 2 a 4 ) = = 0.3,.P 2 = ν B2 (a 3 a 2 ) ν B2 (a 2 a 4 ) = = 0.6. Thus strength of B 1 -path P 1 = (δ.p 1,.P 1) = (0.2, 0.6), strength of B 2 -path P 2 = (δ.p 2,.P 2) = (0.3, 0.6). Defnton In an IFGS Ğs = (A, B 1, B 2,..., B n ) wth underlyng vertex set U: () µ B -strength of connectedness between x and y, s defned by µ B (xy) = j 1 {µj B (xy)}, where µ j B (xy) = (µ j 1 B o µ B )(xy) for j 2 and µ 2 B (xy) = (µ B o µ B )(xy) = z {µ B (xz) µ B (zy)}; () ν B -strength of connectedness between x and y, s defned by ν B (xy) = j 1 {νj B (xy)}, where ν j B (xy) = (ν j 1 B o ν B )(xy) for j 2 and ν 2 B (xy) = (ν B o ν B )(xy) = z {ν B (xz) ν B (zy)}. Example 3.6. Let Ğs = (A, B 1, B 2 ), as shown n Fg. 4, be IFGS of graph structure G = (U, E 1, E 2 ), such that U = {a 1, a 2, a 3 }, E 1 = {a 1 a 2, a 1 a 3 } and E 2 = {a 2 a 3 }. Snce µ B1 (a 1 a 2 ) = 0.3, µ B1 (a 1 a 3 ) = 0.3, µ B1 (a 2 a 3 ) = 0, therefore µ 2 B 1 (a 1 a 2 ) = (µ B1 oµ B1 )(a 1 a 2 ) = µ B1 (a 1 a 3 ) µ B1 (a 3 a 2 ) = = 0, µ 2 B 1 (a 2 a 3 ) = (µ B1 oµ B1 )(a 2 a 3 ) = µ B1 (a 2 a 1 ) µ B1 (a 1 a 3 ) = = 0.3, µ 2 B 1 (a 1 a 3 ) = (µ B1 oµ B1 )(a 1 a 3 ) = µ B1 (a 1 a 2 ) µ B1 (a 2 a 3 ) = = 0, µ 3 B 1 (a 1 a 2 ) = (µ 2 B 1 oµ B1 )(a 1 a 2 ) = µ 2 B 1 (a 1 a 3 ) µ B1 (a 3 a 2 ) = = 0, µ 3 B 1 (a 2 a 3 ) = (µ 2 B 1 oµ B1 )(a 2 a 3 ) = µ 2 B 1 (a 2 a 1 ) µ B1 (a 1 a 3 ) = = 0, µ 3 B 1 (a 1 a 3 ) = (µ 2 B 1 oµ B1 )(a 1 a 3 ) = µ 2 B 1 (a 1 a 2 ) µ B1 (a 2 a 3 ) = = 0. Fgure 4. IFGS Ğs = (A, B 1, B 2 ) Thus, we have µ B 1 (a 1 a 2 ) = {0.3, 0.0, 0.0} = 0.3, µ B 1 (a 2 a 3 ) = {0.0, 0.3, 0.0} = 0.3, µ B 1 (a 1 a 3 ) = {0.3, 0.0, 0.0} = 0.3.
10 228 M. AKRAM AND R. AKMAL Snce ν B1 (a 1 a 2 ) = 0.7, ν B1 (a 1 a 3 ) = 0.3, ν B1 (a 2 a 3 ) = 0, therefore and Thus, we have ν 2 B 1 (a 1 a 2 ) = (ν B1 oν B1 )(a 1 a 2 ) = ν B1 (a 1 a 3 ) ν B1 (a 3 a 2 ) = = 0.3, ν 2 B 1 (a 2 a 3 ) = (ν B1 oν B1 )(a 2 a 3 ) = ν B1 (a 2 a 1 ) ν B1 (a 1 a 3 ) = = 0.7, ν 2 B 1 (a 1 a 3 ) = (ν B1 oν B1 )(a 1 a 3 ) = ν B1 (a 1 a 2 ) ν B1 (a 2 a 3 ) = = 0.7, ν 3 B 1 (a 1 a 2 ) = (ν 2 B 1 oν B1 )(a 1 a 2 ) = ν 2 B 1 (a 1 a 3 ) ν B1 (a 3 a 2 ) = = 0.7, ν 3 B 1 (a 2 a 3 ) = (ν 2 B 1 oν B1 )(a 2 a 3 ) = ν 2 B 1 (a 2 a 1 ) ν B1 (a 1 a 3 ) = = 0.3, ν 3 B 1 (a 1 a 3 ) = (ν 2 B 1 oν B1 )(a 1 a 3 ) = ν 2 B 1 (a 1 a 2 ) ν B1 (a 2 a 3 ) = = 0.3, ν 4 B 1 (a 1 a 2 ) = (ν 3 B 1 oν B1 )(a 1 a 2 ) = ν 3 B 1 (a 1 a 3 ) ν B1 (a 3 a 2 ) = = 0.3, ν 4 B 1 (a 2 a 3 ) = (ν 3 B 1 oν B1 )(a 2 a 3 ) = ν 3 B 1 (a 2 a 1 ) ν B1 (a 1 a 3 ) = = 0.7, ν 4 B 1 (a 1 a 3 ) = (ν 3 B 1 oν B1 )(a 1 a 3 ) = ν 3 B 1 (a 1 a 2 ) ν B (a 2 a 3 ) = = 0.7. ν B 1 (a 1 a 2 ) = {0.7, 0.3, 0.7, 0.3} = 0.7, ν B 1 (a 2 a 3 ) = {0.0, 0.7, 0.3, 0.7} = 0.7, ν B 1 (a 1 a 3 ) = {0.3, 0.7, 0.3, 0.7} = 0.7. By smlar calculatons, t can be easly checked that µ B 2 (a 1 a 2 ) = 0, µ B 2 (a 2 a 3 ) = 0.5, µ B 2 (a 1 a 3 ) = 0, ν B 2 (a 1 a 2 ) = 0.3, ν B 2 (a 2 a 3 ) = 0.3, ν B 2 (a 1 a 3 ) = 0.3. Defnton An IFGS Ğs = (A, B 1, B 2,..., B n ) of a graph structure G = (U, E 1, E 2,..., E n ) s a B -cycle, f G s an E -cycle. Defnton An IFGS Ğs = (A, B 1, B 2,..., B n ) of a graph structure G = (U, E 1, E 2,..., E n ) s an ntutonstc fuzzy B -cycle for some, f followng condtons hold: () Ğs s a B -cycle; () There s no unque B -edge uv n Ğs, such that µ B (uv) = mn{µ B (xy) : xy E = supp(b )} or ν B (uv) = max{ν B (xy) : xy E = supp(b )}. Example 3.7. IFGS Ğs = (A, B 1, B 2 ) shown n Fg. 3, s a B 1 -cycle as well as ntutonstc fuzzy B 1 -cycle, snce (supp(a), supp(b 1 ), supp(b 2 )) s an E 1 -cycle and there are two B 1 -edges wth mnmum degree of membershp and two B 1 -edges wth maxmum degree of nonmembershp of all B 1 -edges. Defnton An IFGS Ğs = (A, B 1, B 2,..., B n ) of a graph structure G = (U, E 1, E 2,..., E n ) s a B -tree, f (supp(a), supp(b 1 ), supp(b 2 ),..., supp(b n )) s an E -tree. In other words, Ğ s s a B -tree f the subgraph of Ğ s, nduced by supp(b ), forms a tree.
11 INTUITIONISTIC FUZZY GRAPH STRUCTURES 229 Defnton An IFGS Ğs = (A, B 1, B 2,..., B n ) of a graph structure G = (U, E 1, E 2,..., E n ) s an ntutonstc fuzzy B -tree (ntutonstc fuzzy B -forest), f Ğ s has an ntutonstc fuzzy partal spannng subgraph structure H s = (A, C 1, C 2,..., C n ), such that H s s a C -tree (C -forest) and µ B (xy) < µ C (xy) and ν B (xy) < ν C (xy) for all B edges not n H s. Example 3.8. The IFGS, shown n Fg. 3, s a B 2 -tree but not an ntutonstc fuzzy B 2 -tree. Whle IFGS Ğs = (A, B 1, B 2 ), shown n Fg. 5, s not a B 1 -tree but an ntutonstc fuzzy B 1 -tree, snce t has an ntutonstc fuzzy partal spannng subgraph structure (A, B 1, B 2) as a B 1 -tree, whch s obtaned by deletng B 1 -edge a 1 a 4 from Ğ s, wth µ B1 (a 1 a 4 ) = 0.3 < 0.4 = µ B (a 1 1 a 4 ) and ν B1 (a 1 a 4 ) = 0.5 < 0.6 = ν B 1(a 1 a 4 ). Fgure 5. IFGS Ğs = (A, B 1, B 2 ) Defnton An IFGS G s1 = (A 1, B 11, B 12,..., B 1n ) of GS G 1 = (U 1, E 11, E 12,..., E 1n ) s somorphc to an IFGS G s2 = (A 2, B 21, B 22,..., B 2n ) of G 2 = (U 2, E 21, E 22,..., E 2n ), f there exst a bjecton f : U 1 U 2 and a permutaton φ on the set {1, 2,..., n}, such that: and for φ() = j µ A1 (u 1 ) = µ A2 (f(u 1 )), ν A1 (u 1 ) = ν A2 (f(u 1 )), for all u 1 U 1 µ B1 (u 1 u 2 ) = µ B2j (f(u 1 )f(u 2 )), ν B1 (u 1 u 2 ) = ν B2j (f(u 1 )f(u 2 )), for all u 1 u 2 E 1, = 1, 2,..., n. Defnton An IFGS G s1 = (A 1, B 11, B 12,..., B 1n ) of GS G 1 = (U, E 11, E 12,..., E 1n ) s dentcal to an IFGS G s2 = (A 2, B 21, B 22,..., B 2n ) of G 2 = (U, E 21, E 22,..., E 2n ), f there exst a bjecton f : U U, such that: µ A1 (u) = µ A2 (f(u)), ν A1 (u) = ν A2 (f(u)), for all u U and µ B1 (u 1 u 2 ) = µ B2 (f(u 1 )f(u 2 )), ν B1 (u 1 u 2 ) = ν B2 (f(u 1 )f(u 2 )), for all u 1 u 2 E 1, = 1, 2,..., n.
12 230 M. AKRAM AND R. AKMAL Example 3.9. Ğs1 and Ğs2, as shown n Fg. 6 and Fg. 7, are IFGSs of graph structures G 1 = (U 1, E 1, E 2, E 3, E 4 ) and G 2 = (U 2, E 1, E 2, E 3, E 4), respectvely, where U 1 = {a 1, a 2, a 3, a 4, a 5 }, E 1 = {a 1 a 2, a 2 a 5 }, E 2 = {a 2 a 3, a 2 a 4 }, E 3 = {a 1 a 3, a 4 a 5 }, E 4 = {a 1 a 5, a 3 a 4 }, U 2 = {b 1, b 2, b 3, b 4, b 5 }, E 1 = {b 2 b 4, b 3 b 4 }, E 2 = {b 1 b 4, b 4 b 5 }, E 3 = {b 1 b 2, b 3 b 5 }, E 4 = {b 1 b 5, b 2 b 3 }. Fgure 6. IFGS Ğs1 = (A 1, B 1, B 2, B 3, B 4 ) Then Ğs1 s somorphc to Ğs2 under the mappng f : U 1 U 2, gven by f(a 1 ) = b 5, f(a 2 ) = b 4, f(a 3 ) = b 3, f(a 4 ) = b 2, f(a 5 ) = b 1, and a permutaton φ gven by such that for all a U 1, and φ(1) = 2, φ(2) = 1, φ(3) = 3, φ(4) = 4, µ A1 (a ) = µ A2 (f(a )), ν A1 (a ) = ν A2 (f(a )) µ Bk (a a j ) = µ Bφ(k) (f(a )f(a j )), ν Bk (a a j ) = ν Bφ(k) (f(a )f(a j )), for all a a j E k, k = 1, 2, 3, 4. Also, Ğ s1 s dentcal wth Ğs2 under the mappng f : U 1 U 2, gven by such that f(a 1 ) = b 3, f(a 2 ) = b 4, f(a 3 ) = b 5, f(a 4 ) = b 1, f(a 5 ) = b 2, µ A1 (a ) = µ A2 (f(a )), ν A1 (a ) = ν A2 (f(a )),
13 INTUITIONISTIC FUZZY GRAPH STRUCTURES 231 for all a U 1, and µ Bk (a a j ) = µ B k (f(a )f(a j )), ν Bk (a a j ) = ν B k (f(a )f(a j )), for all a a j E k, k = 1, 2, 3, 4. Fgure 7. IFGS Ğs2 = (A 2, B 1, B 2, B 3, B 4) Remark 3.1. Identcal IFGSs are always somorphc but the converse s not necessarly true. As IFGS shown n Fg. 3 s somorphc to IFGS shown n Fg. 8 but they are not dentcal. Fgure 8. IFGS G s1 = (A 1, B 1, B 2) Defnton Let Ğs = (A, B 1, B 2,..., B n ) be an ntutonstc fuzzy graph structure of a graph structure G = (U, E 1, E 2,..., E n ). Let φ denote a permutaton on the set {E 1, E 2,..., E n } and the correspondng permutaton on {B 1, B 2,..., B n },.e., φ(b ) = B j ff φ(e ) = E j for all. If xy B r for some r and µ B φ(xy) = µ A (x) µ A (y) µ φbj (xy), j
14 232 M. AKRAM AND R. AKMAL ν B φ(xy) = ν A (x) ν A (y) ν φbj (xy), = 1, 2,..., n, j then xy Bm, φ whle m s chosen such that µ B φ m (xy) µ B φ(xy) and ν B φ m (xy) ν B φ(xy) for all. Then IFGS (A, B φ 1, B φ 2,..., Bn) φ denoted by Ğφc s, s called the φ-complement of IFGS Ğ s. Theorem 3.1. A φ-complement of an ntutonstc fuzzy graph structure s always a strong IFGS. Moreover, f φ() = r for r, {1, 2,..., n}, then all B r -edges n IFGS Ğ s = (A, B 1, B 2,..., B n ) become B φ -edges n Ğφc s = (A, B φ 1, B φ 2,..., Bn). φ Proof. Frst part s obvous from the defnton of φ-complement Ğφc s of IFGS Ğs, snce for any B φ -edge xy, µφ B (xy) and ν φ B (xy) respectvely have the maxmum values of (3.1) [µ A (x) µ A (y)] j That s, µ φbj (xy) and [ν A (x) ν A (y)] j ν φbj (xy). (3.2) µ φ B (xy) = µ A (x) µ A (y), ν φ B (xy) = ν A (x) ν A (y), for all edges xy n Ğφc s, hence Ğφc s s always a strong IFGS. Now suppose on contrary that φ() = r but xy s a B s -edge n Ğs wth s r, whch mples that φb B s. Comparng expressons (3.1) and (3.2), we get µ φbj (xy) = 0, ν φbj (xy) = 0, j whch s not possble because B s = φb j for some j {1, 2,..., 1, + 1,..., n}. So our supposton s wrong and xy must be a B r -edge. Hence we can conclude that f φ() = r, then all B r -edges n IFGS Ğs = (A, B 1, B 2,..., B n ) become B φ -edges n Ğ φc s = (A, B φ 1, B φ 2,..., Bn) φ for r, {1, 2,..., n}. Example Consder IFGS Ğs = (A, B 1, B 2 ) shown n Fg. 4 and let φ be a permutaton on the set {B 1, B 2 } such that φ(b 1 ) = B 2 and φ(b 2 ) = B 1. Now for a 1 a 2 B 1, µ φ B 1 (a 1 a 2 ) = µ A (a 1 ) µ A (a 2 ) j 1[µ φbj (a 1 a 2 )] = [µ φb2 (a 1 a 2 )] j = 0.3 µ B1 (a 1 a 2 ) = = 0, ν φ B 1 (a 1 a 2 ) = ν A (a 1 ) ν A (a 2 ) j 1[ν φbj (a 1 a 2 )] = [ν φb2 (a 1 a 2 )] = 0.7 ν B1 (a 1 a 2 ) = = 0, µ φ B 2 (a 1 a 2 ) = µ A (a 1 ) µ A (a 2 ) j 2[µ φbj (a 1 a 2 )] = [µ φb1 (a 1 a 2 )]
15 INTUITIONISTIC FUZZY GRAPH STRUCTURES 233 = 0.3 µ B2 (a 1 a 2 ) = = 0.3, ν φ B 2 (a 1 a 2 ) = ν A (a 1 ) ν A (a 2 ) j 2[ν φbj (a 1 a 2 )] = [ν φb1 (a 1 a 2 )] = 0.7 ν B2 (a 1 a 2 ) = = 0.7. Clearly, µ φ B 2 (a 1 a 2 ) = 0.3 > 0 = µ φ B 1 (a 1 a 2 ) and ν φ B 2 (a 1 a 2 ) = 0.7 > 0 = ν φ B 1 (a 1 a 2 ), so a 1 a 2 B φ 2. Smlarly for a 1 a 3 B 1, Fgure 9. IFGS Ğφc s = (A, B φ 1, B φ 2 ) µ φ B 1 (a 1 a 3 ) = 0, ν φ B 1 (a 1 a 3 ) = 0.4, µ φ B 2 (a 1 a 3 ) = 0.3, ν φ B 2 (a 1 a 3 ) = 0.7. Clearly, µ φ B 2 (a 1 a 3 ) = 0.3 > 0 = µ φ B 1 (a 1 a 3 ) and ν φ B 2 (a 1 a 3 ) = 0.7 > 0.4 = ν φ B 1 (a 1 a 3 ), so a 1 a 3 B φ 2. And for a 2 a 3 B 2 µ φ B 1 (a 2 a 3 ) = 0.5, ν φ B 1 (a 2 a 3 ) = 0.4, µ φ B 2 (a 2 a 3 ) = 0, ν φ B 2 (a 2 a 3 ) = 0.1, that s, µ φ B 1 (a 2 a 3 ) = 0.5 > 0 = µ φ B 2 (a 2 a 3 ) and ν φ B 1 (a 2 a 3 ) = 0.4 > 0.1 = ν φ B 2 (a 2 a 3 ), so a 2 a 3 B φ 1. Ths mples that B φ 1 = {(a 2 a 3, 0.5, 0.4)}, B φ 2 = {(a 1 a 2, 0.3, 0.7), (a 1 a 3, 0.3, 0.7)} and Ğ φc s = (A, B φ 1, B φ 2 ) shown n Fg. 9 s the φ-complement of Ğ s. Defnton Let Ğs = (A, B 1, B 2,..., B n ) be an IFGS and φ be a permutaton on the set {1, 2,..., n}. Then () Ğs s self-complementary, f t s somorphc to Ğφc s, the φ-complement of Ğ s. () Ğs s strong self-complementary, f t s dentcal to Ğφc s. () Ğs s totally self-complementary, f t s somorphc to Ğφc s, the φ-complement of Ğ s for all permutatons φ on the set {1, 2,..., n}. (v) Ğs s totally strong self-complementary, f t s dentcal to Ğφc s, the φ-complement of Ğ s for all permutatons φ on the set {1, 2,..., n}. Theorem 3.2. An IFGS Ğs s strong f and only f Ğs s totally self-complementary.
16 234 M. AKRAM AND R. AKMAL Proof. Let Ğs be a strong IFGS and φ be any permutaton on the set {1, 2,..., n}. If φ 1 () = j, then by Theorem 3.1, all B -edges n Ğs = (A, B 1, B 2,..., B n ) become -edges n Ğφc s = (A, B φ 1, B φ 2,..., Bn). φ Also Ğφc s s strong, so B φ j µ B (a 1 a 2 ) = µ A (a 1 ) µ A (a 2 ) = µ B φ(a 1 a 2 ), j ν B (a 1 a 2 ) = ν A (a 1 ) ν A (a 2 ) = ν B φ(a 1 a 2 ). j Then Ğs s somorphc to Ğφc s, under the dentty mappng f : U U and a permutaton φ [φ 1 () = j,, j = 1, 2,..., n], such that and µ A (a) = µ A (f(a)), ν A (a) = ν A (f(a)), for all a U µ B (a 1 a 2 ) = µ B φ j ν B (a 1 a 2 ) = ν B φ j (a 1 a 2 ) = µ B φ(f(a 1 )f(a 2 )), j (a 1 a 2 ) = ν B φ j (f(a 1 )f(a 2 )), for all a 1 a 2 E. Ths holds for all permutatons on the set {1, 2,..., n}. Hence Ğs s totally selfcomplementary. Conversely, let φ be any permutaton on the set {1, 2,..., n} and Ğs and Ğφc s be somorphc. From the defnton of φ-complement and somorphsm of IFGSs, we have µ B (a 1 a 2 ) = µ B φ(f(a 1 )f(a 2 )) = µ A (f(a 1 )) µ A (f(a 2 )) = µ A (a 1 ) µ A (a 2 ), j ν B (a 1 a 2 ) = ν B φ(f(a 1 )f(a 2 )) = ν A (f(a 1 )) µ A (f(a 2 )) = ν A (a 1 ) ν A (a 2 ), j for all a 1 a 2 E, = 1, 2,..., n. Hence, Ğ s s a strong IFGS. Remark 3.2. Every self-complementary IFGS s necessarly totally self-complementary. Theorem 3.3. If graph structure G = (U, E 1, E 2,..., E n ) s totally strong selfcomplementary and A s an IFS of U wth constant fuzzy mappngs µ A and ν A then a strong IFGS Ğs = (A, B 1, B 2,..., B n ) of G s totally strong self-complementary. Proof. Consder a strong IFGS Ğs = (A, B 1, B 2,..., B n ) of a graph structure G = (U, E 1, E 2,..., E n ). Suppose that G s totally strong self-complementary and that for some constants s, t [0, 1], A = (µ A, ν A ) s an IFS of U such that µ A (u) = s, ν A (u) = t, for all u U. Then we have to prove that Ğs s totally strong self-complementary. Let φ be an arbtrary permutaton on the set {1, 2,..., n} and φ 1 (j) =. Snce G s totally strong self-complementary, so there exsts a bjecton f : U U, such that for every E -edge a 1 a 2 n G, f(a 1 )f(a 2 ) (an E j -edge n G ) s an E -edge n (G ) φ 1c. Consequently, for every B -edge a 1 a 2 n Ğs, f(a 1 )f(a 2 ) (a B j -edge n Ğs) s a B φ -edge n Ğφc s. From the defnton of A and the defnton of strong IFGS Ğs µ A (a) = s = µ A (f(a)), ν A (a) = t = ν A (f(a)), for all a, f(a) U,
17 INTUITIONISTIC FUZZY GRAPH STRUCTURES 235 and µ B (a 1 a 2 ) = µ A (a 1 ) µ A (a 2 ) = µ A (f(a 1 )) µ A (f(a 2 )) = µ B φ(f(a 1 )f(a 2 )), ν B (a 1 a 2 ) = ν A (a 1 ) ν A (a 2 ) = ν A (f(a 1 )) ν A (f(a 2 )) = ν B φ(f(a 1 )f(a 2 )), for all a 1 a 2 B, = 1, 2,..., n, whch shows Ğs s strong self-complementary. Hence Ğ s s totally strong self-complementary, snce φ s arbtrary. Remark 3.3. Converse of Theorem 3.3 s not necessary, snce a totally strong selfcomplementary and strong IFGS Ğs = (A, B 1, B 2, B 3 ) as shown n Fg. 11, has a totally strong self-complementary underlyng graph structure but µ A and ν A are not constant fuzzy functons. Example The IFGS shown n Fg. 8 s self-complementary,.e., t s somorphc to ts φ-complement, where φ = (1 2). Also, t s totally self-complementary because φ s the only non-dentty permutaton on set {1, 2}. Example The IFGS Ğs = (A 1, B 1, B 2, B 3, B 4 ) shown n Fg. 10, s strong selfcomplementary,.e., t s dentcal to ts φ-complement where the permutaton φ s (1 2) (3 4). It s not totally strong self-complementary. P Fgure 10. IFGS Ğs = (A 1, B 1, B 2, B 3, B 4 ) Example The IFGS Ğs = (A 1, B 1, B 2, B 3 ), shown n Fg. 11, s totally strong self-complementary because t s dentcal to ts φ-complement for all the permutatons φ on the set {1, 2, 3}.
18 236 M. AKRAM AND R. AKMAL Fgure 11. IFGS Ğs = (A 1, B 1, B 2, B 3 ) References [1] M. Akram and B. Davvaz, Strong ntutonstc fuzzy graphs, Flomat 26 (2012), [2] M. Akram and W. A. Dudek, Intutonstc fuzzy hypergraphs wth applcatons, Informaton Scences 218 (2013), [3] M. Akram, A. Ashraf and M. Sarwar, Novel applcatons of ntutonstc fuzzy dgraphs n decson support systems, The Scentfc World Journal (2014), Artcle ID: [4] M. Akram and N. O. Alshehr, Intutonstc fuzzy cycles and ntutonstc fuzzy trees, The Scentfc World Journal 2014 (2014), Artcle ID: [5] K. T. Atanassov, Intutonstc fuzzy sets, In: VII ITKR s Sesson, Sofa (Deposed n Central Scence and Techncal Lbrary, Bulgaran Academy of Scences, Hπ 1697/84, n Bulgaran), [6] K. T. Atanassov, Intutonstc Fuzzy Sets: Theory and Applcatons, Studes n Fuzzness and Soft Computng, Physca-Verlag, Hedelberg, [7] P. Bhattacharya, Some remarks on fuzzy graphs, Pattern Recognton Letters 6 (1987), [8] T. Dnesh, A study on graph structures, Incdence Algebras and ther Fuzzy Analogues, PhD Thess, Kannur Unversty, [9] T. Dnesh and T. V. Ramakrshnan, On generalsed fuzzy graph structures, Appl. Math. Sc. 5(4) (2011), [10] A. Kauffman, Introducton à la Théore des Sous-emsembles Flous: à l usage des ngéneurs, Vol. 1, Masson, Pars, [11] M. G. Karunambga, P. Rangasamy, K. Atanassov and N. Palanappan, An ntutonstc fuzzy graph method for fndng the shortest paths n networks, In: Theoretcal Advances and Applcatons of Fuzzy Logc and Soft Computng, pp. 3 10, [12] S. Mathew and M. S. Suntha, Types of arcs n a fuzzy graph, Informaton Scences 179(11) (2009), [13] S. Mathew and M. S. Suntha, Node connectvty and arc connectvty of a fuzzy graph, Informaton Scences 180(4) (2010), [14] J. N. Mordeson and C. S. Peng, Operatons on fuzzy graphs, Informaton Scences 79 (1994), [15] J. N. Mordeson and P. S. Nar, Fuzzy graphs and fuzzy hypergraphs, Second Edton, Physca Verlag, Hedelberg, [16] R. Parvath, M. G. Karunambga and K. T. Atanassov, Operatons on ntutonstc fuzzy graphs, In: Proceedngs of the IEEE Internatonal Conference on Fuzzy Systems, IEEE, pp , 2009.
19 INTUITIONISTIC FUZZY GRAPH STRUCTURES 237 [17] G. Pas, R. Yager and K. T. Atanassov, Intutonstc fuzzy graph nterpretatons of mult-person mult-crtera decson makng: generalzed net approach, In: Proceedngs of the 2nd IEEE Internatonal Conference on Intellgent Systems, Vol. 2, IEEE, pp , [18] A. Rosenfeld, Fuzzy graphs, fuzzy sets and ther applcatons to cogntve and decson processes, In: Proceedngs of the US-Japan Semnar on Fuzzy Sets and ther Applcatons, Academc Press, pp , [19] E. Sampathkumar, Generalzed graph structures, Bull. Kerala Math. Assoc. 3(2) (2006), [20] A. Shannon, K. T. Atanassov, A frst step to a theory of the ntutonstc fuzzy graphs, In: Proceedng of the Frst Workshop on Fuzzy Based Expert Systems, pp , [21] L. A. Zadeh, Fuzzy sets, Informaton and Control 8 (1965), [22] L. A. Zadeh, Smlarty relatons and fuzzy orderngs, Informaton Scences 3(2) (1971), Department of Mathematcs, Unversty of the Punjab, New Campus, Lahore, Pakstan E-mal address: m.akram@puct.edu.pk 2 Department of Mathematcs, Unversty of the Punjab, New Campus, Lahore, Pakstan E-mal address: raba.akmal@ymal.com
Antipodal Interval-Valued Fuzzy Graphs
Internatonal Journal of pplcatons of uzzy ets and rtfcal Intellgence IN 4-40), Vol 3 03), 07-30 ntpodal Interval-Valued uzzy Graphs Hossen Rashmanlou and Madhumangal Pal Department of Mathematcs, Islamc
More informationTHE RING AND ALGEBRA OF INTUITIONISTIC SETS
Hacettepe Journal of Mathematcs and Statstcs Volume 401 2011, 21 26 THE RING AND ALGEBRA OF INTUITIONISTIC SETS Alattn Ural Receved 01:08 :2009 : Accepted 19 :03 :2010 Abstract The am of ths study s to
More informationInternational Journal of Multidisciplinary Research and Modern Education (IJMRME) ISSN (Online): (
ISSN (Onlne): 454-69 (www.rdmodernresearch.com) Volume II, Issue II, 06 BALANCED HESITANCY FUZZY GRAPHS J. Jon Arockara* & T. Pathnathan** * P.G & Research Department of Mathematcs, St. Joseph s College
More informationDouble Layered Fuzzy Planar Graph
Global Journal of Pure and Appled Mathematcs. ISSN 0973-768 Volume 3, Number 0 07), pp. 7365-7376 Research Inda Publcatons http://www.rpublcaton.com Double Layered Fuzzy Planar Graph J. Jon Arockaraj Assstant
More informationSome Concepts on Constant Interval Valued Intuitionistic Fuzzy Graphs
IOS Journal of Mathematcs (IOS-JM) e-issn: 78-578, p-issn: 39-765X. Volume, Issue 6 Ver. IV (Nov. - Dec. 05), PP 03-07 www.osrournals.org Some Concepts on Constant Interval Valued Intutonstc Fuzzy Graphs
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationModulo Magic Labeling in Digraphs
Gen. Math. Notes, Vol. 7, No., August, 03, pp. 5- ISSN 9-784; Copyrght ICSRS Publcaton, 03 www.-csrs.org Avalable free onlne at http://www.geman.n Modulo Magc Labelng n Dgraphs L. Shobana and J. Baskar
More informationMatrix-Norm Aggregation Operators
IOSR Journal of Mathematcs (IOSR-JM) e-issn: 78-578, p-issn: 39-765X. PP 8-34 www.osrournals.org Matrx-Norm Aggregaton Operators Shna Vad, Sunl Jacob John Department of Mathematcs, Natonal Insttute of
More informationComplement of Type-2 Fuzzy Shortest Path Using Possibility Measure
Intern. J. Fuzzy Mathematcal rchve Vol. 5, No., 04, 9-7 ISSN: 30 34 (P, 30 350 (onlne Publshed on 5 November 04 www.researchmathsc.org Internatonal Journal of Complement of Type- Fuzzy Shortest Path Usng
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationOn Similarity Measures of Fuzzy Soft Sets
Int J Advance Soft Comput Appl, Vol 3, No, July ISSN 74-853; Copyrght ICSRS Publcaton, www-csrsorg On Smlarty Measures of uzzy Soft Sets PINAKI MAJUMDAR* and SKSAMANTA Department of Mathematcs MUC Women
More informationSoft Neutrosophic Bi-LA-semigroup and Soft Neutrosophic N-LA-seigroup
Neutrosophc Sets and Systems, Vol. 5, 04 45 Soft Neutrosophc B-LA-semgroup and Soft Mumtaz Al, Florentn Smarandache, Muhammad Shabr 3,3 Department of Mathematcs, Quad--Azam Unversty, Islamabad, 44000,Pakstan.
More informationCHAPTER 4 MAX-MIN AVERAGE COMPOSITION METHOD FOR DECISION MAKING USING INTUITIONISTIC FUZZY SETS
56 CHAPER 4 MAX-MIN AVERAGE COMPOSIION MEHOD FOR DECISION MAKING USING INUIIONISIC FUZZY SES 4.1 INRODUCION Intutonstc fuzz max-mn average composton method s proposed to construct the decson makng for
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationNeutrosophic Bi-LA-Semigroup and Neutrosophic N-LA- Semigroup
Neutrosophc Sets Systems, Vol. 4, 04 9 Neutrosophc B-LA-Semgroup Neutrosophc N-LA- Semgroup Mumtaz Al *, Florentn Smarache, Muhammad Shabr 3 Munazza Naz 4,3 Department of Mathematcs, Quad--Azam Unversty,
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationPAijpam.eu SOME NEW SUM PERFECT SQUARE GRAPHS S.G. Sonchhatra 1, G.V. Ghodasara 2
Internatonal Journal of Pure and Appled Mathematcs Volume 113 No. 3 2017, 489-499 ISSN: 1311-8080 (prnted verson); ISSN: 1314-3395 (on-lne verson) url: http://www.jpam.eu do: 10.12732/jpam.v1133.11 PAjpam.eu
More informationRegular product vague graphs and product vague line graphs
APPLIED & INTERDISCIPLINARY MATHEMATICS RESEARCH ARTICLE Regular product vague graphs and product vague lne graphs Ganesh Ghora 1 * and Madhumangal Pal 1 Receved: 26 December 2015 Accepted: 08 July 2016
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationProperties of intuitionistic fuzzy line graphs
16 th Int. Conf. on IFSs, Sofia, 9 10 Sept. 2012 Notes on Intuitionistic Fuzzy Sets Vol. 18, 2012, No. 3, 52 60 Properties of intuitionistic fuzzy line graphs M. Akram 1 and R. Parvathi 2 1 Punjab University
More informationIrene Hepzibah.R 1 and Vidhya.R 2
Internatonal Journal of Scentfc & Engneerng Research, Volume 5, Issue 3, March-204 374 ISSN 2229-558 INTUITIONISTIC FUZZY MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM (IFMOLPP) USING TAYLOR SERIES APPROACH
More informationMATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1
MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationDiscrete Mathematics. Laplacian spectral characterization of some graphs obtained by product operation
Dscrete Mathematcs 31 (01) 1591 1595 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc Laplacan spectral characterzaton of some graphs obtaned
More informationFuzzy Boundaries of Sample Selection Model
Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationSUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION
talan journal of pure appled mathematcs n. 33 2014 (63 70) 63 SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION M.R. Farhangdoost Department of Mathematcs College of Scences Shraz Unversty Shraz, 71457-44776
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationOn the smoothness and the totally strong properties for nearness frames
Int. Sc. Technol. J. Namba Vol 1, Issue 1, 2013 On the smoothness and the totally strong propertes for nearness frames Martn. M. Mugoch Department of Mathematcs, Unversty of Namba 340 Mandume Ndemufayo
More informationOn Graphs with Same Distance Distribution
Appled Mathematcs, 07, 8, 799-807 http://wwwscrporg/journal/am ISSN Onlne: 5-7393 ISSN Prnt: 5-7385 On Graphs wth Same Dstance Dstrbuton Xulang Qu, Xaofeng Guo,3 Chengy Unversty College, Jme Unversty,
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationResearch Article Relative Smooth Topological Spaces
Advances n Fuzzy Systems Volume 2009, Artcle ID 172917, 5 pages do:10.1155/2009/172917 Research Artcle Relatve Smooth Topologcal Spaces B. Ghazanfar Department of Mathematcs, Faculty of Scence, Lorestan
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationA Simple Research of Divisor Graphs
The 29th Workshop on Combnatoral Mathematcs and Computaton Theory A Smple Research o Dvsor Graphs Yu-png Tsao General Educaton Center Chna Unversty o Technology Tape Tawan yp-tsao@cuteedutw Tape Tawan
More informationON SEPARATING SETS OF WORDS IV
ON SEPARATING SETS OF WORDS IV V. FLAŠKA, T. KEPKA AND J. KORTELAINEN Abstract. Further propertes of transtve closures of specal replacement relatons n free monods are studed. 1. Introducton Ths artcle
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationBinomial transforms of the modified k-fibonacci-like sequence
Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc
More informationComparative Studies of Law of Conservation of Energy. and Law Clusters of Conservation of Generalized Energy
Comparatve Studes of Law of Conservaton of Energy and Law Clusters of Conservaton of Generalzed Energy No.3 of Comparatve Physcs Seres Papers Fu Yuhua (CNOOC Research Insttute, E-mal:fuyh1945@sna.com)
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introducton to Cluster Algebra Ivan C.H. Ip Updated: Ma 7, 2017 3 Defnton and Examples of Cluster algebra 3.1 Quvers We frst revst the noton of a quver. Defnton 3.1. A quver s a fnte orented
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationFREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,
FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationThe Pseudoblocks of Endomorphism Algebras
Internatonal Mathematcal Forum, 4, 009, no. 48, 363-368 The Pseudoblocks of Endomorphsm Algebras Ahmed A. Khammash Department of Mathematcal Scences, Umm Al-Qura Unversty P.O.Box 796, Makkah, Saud Araba
More informationNeryškioji dichotominių testo klausimų ir socialinių rodiklių diferencijavimo savybių klasifikacija
Neryškoj dchotomnų testo klausmų r socalnų rodklų dferencjavmo savybų klasfkacja Aleksandras KRYLOVAS, Natalja KOSAREVA, Julja KARALIŪNAITĖ Technologcal and Economc Development of Economy Receved 9 May
More informationSmooth Neutrosophic Topological Spaces
65 Unversty of New Mexco Smooth Neutrosophc opologcal Spaces M. K. EL Gayyar Physcs and Mathematcal Engneerng Dept., aculty of Engneerng, Port-Sad Unversty, Egypt.- mohamedelgayyar@hotmal.com Abstract.
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationThe probability that a pair of group elements is autoconjugate
Proc. Indan Acad. Sc. (Math. Sc.) Vol. 126, No. 1, February 2016, pp. 61 68. c Indan Academy of Scences The probablty that a par of group elements s autoconjugate MOHAMMAD REZA R MOGHADDAM 1,2,, ESMAT
More informationLEVEL SET OF INTUITIONTISTIC FUZZY SUBHEMIRINGS OF A HEMIRING
LEVEL SET OF INTUITIONTISTIC FUZZY SUBHEMIRINGS OF HEMIRING N. NITH ssstant Proessor n Mathematcs, Peryar Unversty PG Extn Centre, Dharmapur 636705. Emal : anthaarenu@gmal.com BSTRCT: In ths paper, we
More informationTRANSPOSE ON VERTEX SYMMETRIC DIGRAPHS
TRANSPOSE ON VERTEX SYMMETRIC DIGRAPHS Vance Faber Center for Computng Scences, Insttute for Defense Analyses Abstract. In [] (and earler n [3]), we defned several global communcaton tasks (unversal exchange,
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationAmusing Properties of Odd Numbers Derived From Valuated Binary Tree
IOSR Journal of Mathematcs (IOSR-JM) e-iss: 78-578, p-iss: 19-765X. Volume 1, Issue 6 Ver. V (ov. - Dec.016), PP 5-57 www.osrjournals.org Amusng Propertes of Odd umbers Derved From Valuated Bnary Tree
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationZ 4p - Magic labeling for some special graphs
Internatonal Journal of Mathematcs and Soft Computng Vol., No. (0, 6-70. ISSN Prnt : 49-8 Z 4p - Magc labelng for some specal graphs ISSN Onlne: 9-55 V.L. Stella Arputha Mary Department of Mathematcs,
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationThe Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices
Internatonal Mathematcal Forum, Vol. 6, 2011, no. 15, 713-721 The Degrees of Nlpotency of Nlpotent Dervatons on the Rng of Matrces Homera Pajoohesh Department of of Mathematcs Medgar Evers College of CUNY
More informationA CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA
A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes
More informationVertex Graceful Labeling-Some Path Related Graphs
Internatonal J.Math. Combn. Vol.3013), 44-49 Vertex Graceful Labelng-Some Path Related Graphs P.Selvaraju 1, P.Balaganesan and J.Renuka 3 1 Department of Mathematcs, Vel Tech Engneerng College, Avad, Chenna-
More informationIntuitionistic Fuzzy G δ -e-locally Continuous and Irresolute Functions
Intern J Fuzzy Mathematcal rchve Vol 14, No 2, 2017, 313-325 ISSN 2320 3242 (P), 2320 3250 (onlne) Publshed on 11 December 2017 wwwresearchmathscorg DOI http//dxdoorg/1022457/jmav14n2a14 Internatonal Journal
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationExistence of Two Conjugate Classes of A 5 within S 6. by Use of Character Table of S 6
Internatonal Mathematcal Forum, Vol. 8, 2013, no. 32, 1591-159 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/mf.2013.3359 Exstence of Two Conjugate Classes of A 5 wthn S by Use of Character Table
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationStatistical Mechanics and Combinatorics : Lecture III
Statstcal Mechancs and Combnatorcs : Lecture III Dmer Model Dmer defntons Defnton A dmer coverng (perfect matchng) of a fnte graph s a set of edges whch covers every vertex exactly once, e every vertex
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationOpen Systems: Chemical Potential and Partial Molar Quantities Chemical Potential
Open Systems: Chemcal Potental and Partal Molar Quanttes Chemcal Potental For closed systems, we have derved the followng relatonshps: du = TdS pdv dh = TdS + Vdp da = SdT pdv dg = VdP SdT For open systems,
More informationOn cyclic of Steiner system (v); V=2,3,5,7,11,13
On cyclc of Stener system (v); V=,3,5,7,,3 Prof. Dr. Adl M. Ahmed Rana A. Ibraham Abstract: A stener system can be defned by the trple S(t,k,v), where every block B, (=,,,b) contans exactly K-elementes
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationDiscrete Mathematics
Dscrete Mathematcs 30 (00) 48 488 Contents lsts avalable at ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc The number of C 3 -free vertces on 3-partte tournaments Ana Paulna
More informationOutline. Bayesian Networks: Maximum Likelihood Estimation and Tree Structure Learning. Our Model and Data. Outline
Outlne Bayesan Networks: Maxmum Lkelhood Estmaton and Tree Structure Learnng Huzhen Yu janey.yu@cs.helsnk.f Dept. Computer Scence, Unv. of Helsnk Probablstc Models, Sprng, 200 Notces: I corrected a number
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationEvery planar graph is 4-colourable a proof without computer
Peter Dörre Department of Informatcs and Natural Scences Fachhochschule Südwestfalen (Unversty of Appled Scences) Frauenstuhlweg 31, D-58644 Iserlohn, Germany Emal: doerre(at)fh-swf.de Mathematcs Subject
More informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationA New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems
Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationLinear programming with Triangular Intuitionistic Fuzzy Number
EUSFLAT-LFA 2011 July 2011 Ax-les-Bans, France Lnear programmng wth Trangular Intutonstc Fuzzy Number Dpt Dubey 1 Aparna Mehra 2 1 Department of Mathematcs, Indan Insttute of Technology, Hauz Khas, New
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More information