LAPLACIAN ENERGY OF GENERALIZED COMPLEMENTS OF A GRAPH
|
|
- Elfreda Horn
- 5 years ago
- Views:
Transcription
1 Kragujevac Joural of Mathematics Volume 4 018, Pages LAPLACIAN ENERGY OF GENERALIZED COMPLEMENTS OF A GRAPH H J GOWTHAM 1, SABITHA D SOUZA 1, AND PRADEEP G BHAT 1 Abstract Let P = {V 1, V, V 3,, V k } be a partitio of vertex set V G of order k For all V i ad V j i P, i j, remove the edges betwee V i ad V j i graph G ad add the edges betwee V i ad V j which are ot i G The graph G P k thus obtaied is called the k complemet of graph G with respect to a partitio P For each set V r i P, remove the edges of graph G iside V r ad add the edges of G the complemet of G joiig the vertices of V r The graph G P ki thus obtaied is called the ki complemet of graph G with respect to a partitio P I this paper, we study Laplacia eergy of geeralized complemets of some families of graph A effort is made to throw some light o showig variatio i Laplacia eergy due to chages i a partitio of the graph 1 Itroductio Let G be a graph o vertices ad m edges The complemet of a graph G, deoted as G has the same vertex set as that of G, but two vertices are adjacet i G if ad oly if they are ot adjacet i G If G is isomorphic to G the G is said to be self-complemetary graph For all otatios ad termiologies we refer [, 15, 1] E Sampathkumar et al have itroduced two types of geeralized complemets [19] of a graph For completeess we produce these here Let P = {V 1, V, V 3,, V k } be a partitio of vertex set V G of order k For all V i ad V j i P, i j, remove the edges betwee V i ad V j i graph G ad add the edges betwee V i ad V j which are ot i G The graph G P k thus obtaied is called the k complemet of graph G with respect to a partitio P For each set V r i P, remove the edges of graph G iside V r ad add the edges of G joiig the vertices Key words ad phrases Geeralized complemets, Laplacia spectrum, Laplacia eergy 010 Mathematics Subject Classificatio Primary: 05C15 Secodary: 05C50 Received: April 09, 016 Accepted: March 03,
2 300 H J GOWTHAM, S D SOUZA, AND P G BHAT of V r The graph G P ki thus obtaied is called the ki-complemet of graph G with respect to a partitio P The eergy of the graph is first defied by Iva Gutma [10] i 1978 as the sum of absolute eigevalues of graph G For more iformatio o eergy of a graph we refer [1,3,5,7 9,1,13,17,18,0] Let DG = diagd 1, d,, d be the diagoal matrix of vertex degrees, ad AG is the adjacecy matrix The LG = DG AG is the Laplacia matrix of graph G The characteristic polyomial of the Laplacia matrix is deoted by φlg, µ = detµi LG Let {µ 1, µ,, µ } be the Laplacia eigevalues of graph G, ie, the roots of φlg, µ The Laplacia eergy[14], deoted by LEG, is defied as LEG = µ i m The Laplacia eergy LEG is a very recetly defied graph ivariat The basic properties for Laplacia eergy have bee established i [4,6,11,14,,3], ad it has foud remarkable chemical applicatios I this paper we study the Laplacia eergy of geeralized complemets of some classes of graphs Prelimiaries Propositio 1 [19] The k-complemet ad ki complemet of G are related as follows: i G P k = G P ki ; ii G P ki = G P k Theorem 1 [6] Let G be a graph with vertices ad G be its complemet If the Laplacia spectrum of G is {µ 1, µ,, µ }, the the Laplacia spectrum of G is { µ 1, µ,, µ 1, 0} Defiitio 1 [6] Let f i, i = 1,,, k, 1 k p, be idepedet edges of the complete graph K p, p 3 The graph Kb p k is obtaied by deletig f i, i = 1,,, k, from K p I additio Kb p 0 = K p Propositio [6] For p 3 ad 0 k p, LEKb p k = p + 4 k 4k p p Lemma 1 [16] Let A = [ ] A0 A 1 A 1 A 0 be a block symmetric matrix The the eigevalues of A are the eigevalues of the matrices A 0 + A 1 ad A 0 A 1
3 LAPLACIAN ENERGY OF GENERALIZED COMPLEMENTS OF A GRAPH Laplacia eergy of geeralized complemets of classes of graphs Now we fid Laplacia eergy of geeralized complemets of some stadard graphs like complete, complete bipartite, path, cycle, double star, friedship ad cocktail party graph For some graphs we take partitio of order k ad for some partitio of order two Theorem 31 Let P = {V 1, V,, V k } be a partitio of the complete graph K i If < V i >= K i, for i = 1,,,, the k k i C k k k i C K P k = + i 1 i ad C k i C K P ki =k 1 + k + k C k i C + i 1 i ii If V i = ad oe of V i = 1 whe is odd, the LE K P k = 4k k ad K P 3 kk 1 ki = Proof For a partitio P = {V 1, V,, V k }, let G = K P k be a graph i If < V i >= K i, for i = 1,,,, the G is the uio of k discoected complete subgraphs of order i such that i = If i, the Laplacia spectrum of K i cosists of {0, i i 1 times}, { i = 1,,, } 0 The the Laplacia spectrum of K P 1 k is k k k 1 k ic ad the average degree of K P k =, k k i C k k k i C K P k = + i 1 i, where V i = i, i = 1,,, k
4 30 H J GOWTHAM, S D SOUZA, AND P G BHAT By otig that K P ki = K P k ad from Theorem 1, we obtai Lapla- } { 0 cia spectrum of K P ki is 1 k 1 k k 1 k C ic average degree of K P ki is, K P ki =k 1 + k + C k i C k C k i C + i 1 i, ad the where V i = i, i = 1,,, k, if is eve, ii If V i =, the k = + 1, if is odd It follows by substitutig the value of k i Theorem 31 of statemet i Also, the Laplacia spectrum of G is give by {0k times, k times} Average degree of G is m = k Thus, LEG = µ i m k k = k + k k k k k = + 4k k =, k 1 Hece, Laplacia spectrum of G cosists of {0, k times, k 1 times} Average degree of G is m = 1 k LEG = µ i m 1 k = 1 k + k
5 LAPLACIAN ENERGY OF GENERALIZED COMPLEMENTS OF A GRAPH k + k 1 3 kk 1 =, k 1 Remark 31 Let P = {V 1, V,, V k } be a partitio of the complete graph K with V i = ad oe of V i = 1, if is odd The, LE K P k + LE K P ki = 3 4, if is eve, 3 1, if is odd Theorem 3 Let P = {V 1, V,, V k } be a partitio of path P i If ay oe of the pedat vertex is i V 1 or V k, ad remaiig k 1 sets are K s, the P P ki = {kk 1 + k k + 1}, whereas [ ] P P k = LE Kb = + 4 4, for odd 3 ii If ay oe of the o pedat vertex is i V i, 3 i ad remaiig k 1 sets are K s, the P P ki = [ k + kk + ], whereas P P k = [ k + kk 1], k = for odd 5 iii If < V i >= K, the P P 4 ki = k 1 k + 1 ad P P k = 1, for eve Proof i If ay oe of the pedat vertex is i V 1 or V k, ad remaiig k 1 sets are K s, the P P ki is the uio of k 1 K s ad oe isolated vertex Laplacia spectrum of P P ki is {0k times, k times} The average degree of P P ki is k 1, ie, P P ki =k k 1 + k k 1 = [ k + kk + ]
6 304 H J GOWTHAM, S D SOUZA, AND P G BHAT Note that P P k is the graph obtaied from K by deletig all the idepedet edges, P P k = Kb Hece, from Propositio, LE P P k [ ] = LE Kb = ii If ay oe of the o pedat vertex is i V i, 3 i ad remaiig k 1 sets are K s, the P P ki is the uio of K 1,, k K s ad two isolated vertices Hece, Laplacia spectrum of P P ki is {0k times, 1, k times, 3} The average degree of P P k 1 ki is, ie, P P ki =k k 1 + k k k k 1 = [ k + kk + ] Also from Theorem 1, Laplacia spectrum of P P k is {0, 3, k times, 1, k 1 times} Average degree of P P k is 1 k 1 Hece, P P 1 k 1 k = 1 k k 1 + k 1 k k 1 + k 1 = [ k + kk + ] iii If < V i >= K, the P P ki is the uio of k 1 K s ad two isolated vertices Its Laplacia spectrum is {0 k + 1 times, k 1 times} ad average degree is k 1 Hece, P P ki = k + 1 k 1 + k 1 k 1 = 4 k 1 k + 1
7 LAPLACIAN ENERGY OF GENERALIZED COMPLEMENTS OF A GRAPH 305 Also from Theorem 1, Laplacia spectrum of P P k is {0, k 1 times, k times} Average degree of P P k is 1 k 1 Thus, P P 1 k = [ + k 1 + k 1 + k 1 k 1] Note that k = for path of eve order, hece, we obtai, P P k = 1 Remark 3 As k = for path of eve order, P P ki = 4 Theorem 33 Let P = {V 1, V,, V k } be a partitio of cycle C i If ay of the V i is K 1 ad remaiig V j s are all K s, where i j The C P [ ki = k + k ], whereas C P 4k k = [ ], for odd 3 ii If each V i cosists of K, the C P ki = [k + k ], whereas C P k = + 4 4, for eve 4 Proof i If ay of the V i is K 1 ad remaiig V j s are all K s, where i j The C P ki is the uio of K 1, ad k 1 K s Hece, Laplacia spectrum of C P ki is {0k 1 times, 1, k 1 times, 3} The average degree of C P ki is k ad LE C ki =k 1 k + 1 k + k 1 k + 3 k = [ k + k ] Also accordig to Theorem 1, Laplacia spectrum of C P k is {0, 3, k 1 times, 1, k times} The average degree of C P k is 1 k Thus LE C P 1 k k = + 1 k 3 1 k + 1
8 306 H J GOWTHAM, S D SOUZA, AND P G BHAT 1 k + k 1 1 k + k = 4k [ ] ii If each V i cosists of K, the C P ki has k compoets of K Hece, Laplacia specrtum of C P ki is {0k times, k times} The average degree of C P ki is k ad LEC P ki = k k + k k = [ k + k ] Also from Theorem 1, Laplacia spectrum of C P k is {0, k times, k 1 times} As C P ki has k edges, C P k has C k edges Also, ote that C P k has K k idepedet edges For cycle of eve order, k =, we have C P k = LE Kb = Theorem 34 Let K m, = {U m, U } be complete bipartite graph with partitio P = {V 1, V } The, i If < V 1 >= K s1,s ad < V >= K m s1, s, where s 1, s deote umber of vertices of V 1 such that s 1 vertices belog to U m ad s vertices belog to U ad s 1 < m, s <, the where ad LE K m, P =q + s1 + s m s + s 1 s 1 + s m s + s 1 s 1 + s + m s + s 1, s 1 + s, if s 1 + s m s + s 1, q = m s + s 1, if m s + s 1 < s 1 + s LE K m, P i = m + ii If V 1 = m 1 such that all the vertices of V 1 are from first partite set of K m, ad V = + 1, the LE K m, P + = ad LE K m, P i = m +
9 LAPLACIAN ENERGY OF GENERALIZED COMPLEMENTS OF A GRAPH 307 Proof i If < V 1 >= K s1,s ad < V >= K m s1, s, the Hece, K m, P = K s1 +s,m s +s 1 LE K m, P =q + s1 + s m s + s 1 s 1 + s m s + s 1 s 1 + s + m s + s 1, where s 1 + s, if s 1 + s m s + s 1, q = m s + s 1, if m s + s 1 < s 1 + s Also LE K m, P i = Km K Hece, LE K m, P i = LEKm + LEK = m + ii If V 1 = m 1 such that all the vertices of V 1 are from first partite set of K m, ad V = + 1, the K m, P = K 1,m+ 1 Hece K m, P = + Also Km, P i = K 1 K m+ 1 Thus, K m, P i = m +, which is stated Theorem 35 Let Sm, be double star graph with partitio P = {V 1, V }, such that the vertices of V 1 ad V are of distace two The m + m + 1, if m >, LE m + Sm, i P m + m + m 1 =, if > m, m + 4m +, if m =, m + ad LE Sm, P 1 1m 1 = m + Proof Let V 1 ad V be the partitio of vertices of Sm, such that the vertices of V 1 ad V are of distace two, ie, V 1 ={v 1, v, v 3,, v m 1, u 1 } ad V ={v m, u, u 3,,
10 308 H J GOWTHAM, S D SOUZA, AND P G BHAT u 1, u } We have LSm, P i = v 1 v v 3 v m 1 v m u 1 u u v 1 m v 1 m v m v m m v m m u m u u Cosider det λi L Sm, P i Step 1: Replace R i by R i R i+1, for i = v 1, v, v 3,, v m, v m ad replace R i by R i R i 1, for i = u, u 1,, u 4, u 3 The det λi L Sm, P i is of the form λ m + 1 m λ + 1 λ + m detd Step : I detd, replace C i by C i C i 1, for i = v, v 3, v 4,, v m 1 ad replace C i by C i C i+1, for i = u 1, u,, u, u 1 The it reduces to a ew determiat λ dete =, m 1 1 λ m λ 1 λ ie, dete= λλ λ + m The Laplacia spectrum of Sm, P ki is {0,, + m times, m + 1m times, + 1 times} ad the average degree of Sm, P i is +1+mm+1 Hece, m+ Sm, P mm + 1 i = m mm m mm m m mm m m + 1 m mm m + If m >, Sm, P m + m + 1 i = m +
11 LAPLACIAN ENERGY OF GENERALIZED COMPLEMENTS OF A GRAPH 309 If > m, If m =, Sm, P m + m + m 1 i = m + LE Sm, P i 4m + = m + Also from Theorem 1, Laplacia spectrum of Sm, P is {03 times, m 1 times, 1m times, + m } Average degree of Sm, P is m 1 1 Thus, 4+ LE m 1 1 Sm, P =3 4 + m m m m m m 4 + = 4m + m + Theorem 36 Let F be friedship graph with partitio P = {V 1, V }, such that a partitio V 1 cotais cetral vertex ad remaiig vertices are i a partitio V The F P i = + 1 ad LE F P = Proof Let V 1 ad V be the partitio of vertices of F ad a partitio V 1 cotais oly the cetral vertex ad remaiig vertices are i a partitio V We have v 1 v v 3 v 4 v 1 v v +1 v v +1 v v v v LF P i = v v v v v Cosider det λi LF P i
12 310 H J GOWTHAM, S D SOUZA, AND P G BHAT Step 1: Replace R i by R i R i 1, where i = v +1, v, v 1,, v 3, v The we coclude that det λi LF P i is of the form λ 1 detd Step : I detd, replace C i by C i + C i+1, where i = v, v 1, v,, v 1 We get a ew determiat, let it be dete Step 3: I dete, replace R i by R i + R i 1, where i = v 4, v 6, v 8,, v, v, the the etries below the pricipal diagoal are zeros Hece dete = λλ +1 Thus, det λi LF P i = λλ + 1 λ 1 Therefore, Laplacia spectrum of F P i is {0, 1 times, + 1 times} ad the average degree of F P 4 i is Hece, +1 F P 4 i = = + 1 Also from Theorem 1, Laplacia spectrum of F P Average degree of F P is Thus, +1 is {0 + 1 times, times} LE F P = = Theorem 37 Let F be friedship graph with partitio P = {V 1, V }, such that a partitio V 1 cotais oe triagle ad remaiig vertices are i a partitio V The ad F P i = , if = 3, F P = , if > Proof If V 1 ad V be the partitio of F, such that a partitio V 1 cotais oe triagle ad remaiig vertices are i a partitio V The
13 LAPLACIAN ENERGY OF GENERALIZED COMPLEMENTS OF A GRAPH 311 v 1 v v 3 v 4 v 5 v 1 v v +1 v +1 v v v v v v LF P i = v v v v v Cosider det λi LF i P Step 1: Replace R i by R i R i 1, where i = v +1, v, v 1,, v 5 ad replace R v4 by R v4 R v1 The det λi LF i P is of the form λ λ 3 1 detd Step : I detd, replace C i by C i + C i+1, where i = v, v 1, v,, v 4 We get a ew determiat, let it be dete Step 3: I dete, replace R i by R i + R i 1, where i = v, v, v 4,, v 6 ad simplifyig we get, λ 0 0 dete = λ λ λ + 1 Thus, = λ 1 λλ 1 det λi L F P i = λ 3 λ 1 1 λ 3 1 Therefore, the Laplacia spectrum of F P i is {03 times, 1 1 times, 3 1 times} ad the average degree of F P i is 4 +1 Hece, +1 LE 4 F P + 1 i = = Also from Theorem 1, Laplacia spectrum of F P is {0, 1 times, 4 1 times, + 1 times} Average degree of F P is
14 31 H J GOWTHAM, S D SOUZA, AND P G BHAT If = 3, the F P 10 4 = = If > 3, LE F P = + 1 Theorem 38 Let K be cocktail party graph with vertex set V = {v 1, v,, v, u 1, u,, u } ad partitio P = {V 1, V }, such that V 1 cotais v i vertices, ad remaiig u i vertices are i V, where i = 1,, 3,, The LE K P i = LE K P = 4 1 Proof Let K be a cocktail party graph with vertex set V = {v 1, v,, v, u 1, u,, u } ad P = {V 1, V } be a partitio of vertices of K such that V 1 = {v 1,, v } ad V ={u 1, u, u 3,, u } We have [ ] LK P 1I I J i = I J 1I [ ] A0 A It is of the form 1 Hece, from Lemma 1, we get, Laplacia spectrum of A 1 A 0 K P i is {0,, 1 times, 1 times} ad the average degree of K P i is 1 Hece, K P 1 i = =4 1 Also from Theorem 1, Laplacia spectrum of K P is {0,, 1 times, + 1 times} Average degree of K P is Thus, LE K P = = 4 1 Theorem 39 For cocktail graph K with a partitio P = {V 1, V,, V }, such that V i cosists of K i respective partitio, where i = 1,,, The LE K P ki = 10 6 ad LE K P k = 4
15 LAPLACIAN ENERGY OF GENERALIZED COMPLEMENTS OF A GRAPH 313 Proof Let P = {V 1, V,, V } be a partitio of cocktail party graph K, such that V i cosists of K i respective partitio, where i = 1,,, The, we have v 1 v v 3 v 1 v u 1 u u v v v v LK P ki = v v u u u u [ ] A0 A 1 It is of the form Hece, from Lemma 1, we get Laplacia spectrum of A 1 A 0 K P ki is {0, 4 1 times, 4 times, 4 4 times} ad the average degree of K P ki is 4 3 Hece, LE K P ki = =10 6 Also from Theorem 1, Laplacia spectrum of K P k 4 times} Average degree of K P k is Thus, is {0 times, times, LE K P k = = 4 Theorem 310 For cocktail graph K +1 with a partitio P = {V 1, V,, V + }, such that V i cosists of K i respective partitio, where i = 1,,, ad V j cosists of K 1 i respective partitio, where j = 1, The LE K +1 P ki = Proof For the give partitio ad LE K +1 P k 8 6 = + 1 v 1 v v 3 v +1 u 1 u u u v v v v LK +1 P ki = v v u u u u
16 314 H J GOWTHAM, S D SOUZA, AND P G BHAT [ ] A0 A It is of the form 1 Hece, from Lemma 1, we get Laplacia Spectrum A 1 A 0 of K +1 P ki is {0, times, 4 times, 4 + times} ad the average degree of K +1 P ki is 44 + Hece, 4+ K +1 P 44 + ki = = + 1 Also from Theorem 1, Laplacia spectrum of K +1 P k is {0 + 1 times, + 1 times, 4 times} Average degree of K +1 P k is 4+1 Thus, K +1 P k = = Refereces [1] R Balakrisha, The eergy of a graph, Liear Algebra Appl , [] R B Bapat, Graphs ad Matrices, Spriger-Hidusta Book Agecy, Lodo, 011 [3] R B Bapat ad S Pati, Eergy of a graph is ever a odd iteger, Bull Kerala Math Assoc 1 004, [4] P G Bhat ad S D Souza, Color sigless laplacia eergy of graphs, AKCE It J Graphs Comb 017, [5] D M Cvetković, M Doob ad H Sachs, Spectra of Graphs, Theory ad Applicatios, third ed, Joha Ambrosius Barth, Heidelberg, 1995 [6] N M M de Abreu, C T M Viagre, A S Boifácio ad I Gutma, The laplacia eergy of some laplacia itegral graphs, MATCH Commu Math Comput Chem , [7] A Graovac, I Gutma ad N Triajstic, Topological Approach to the Chemistry of Cojugated Molecules, Spriger-Verlag, Berli, 1977 [8] I Gutma, The eergy of a graph, Ber Math Stat Sekt Forschugsz Graz , 1 [9] I Gutma, Topological studies o hetero cojugated molecules, Z Naturforch , [10] I Gutma, The eergy of a graph: old ad ew results, i: A Bette, A Kohert, R Laue ad A Wasserma Eds, Algebraic Combiatorics ad Applicatios, Spriger-Verlag, Berli, 001, pp [11] I Gutma, Topology ad stability of cojugated hydrocarbos the depedece of total π-electro eergy o molecular topology, J Serb Chem Soc , [1] I Gutma ad M Mateljević, Topological studies o hetero cojugated molecules, J Math Chem , [13] I Gutma ad O E Polasky, Mathematical Cocepts i Orgaic Chemistry, Spriger-Verlag, Berli, 1986 [14] I Gutma ad B Zhou, Laplacia eergy of a graph, Liear Algebra Appl , 9 37 [15] F Harary, Graph Theory, Narosa Publishig House, New Delhi, 1989
17 LAPLACIAN ENERGY OF GENERALIZED COMPLEMENTS OF A GRAPH 315 [16] G Idulal, I Gutma ad A Vijayakumar, O distace eergy of graphs, MATCH Commu Math Comput Chem , [17] X Li, Y Shi ad I Gutma, Graph Eergy, Spriger, New York, 010 [18] S Pirzada ad I Gutma, Eergy of a graph is ever the square root of a odd iteger, Appl Aal Discr Math 008, [19] E Sampathkumar, L Pushpalatha, C V Vekatachalam ad P G Bhat, Geeralized complemets of a graph, Idia J Pure Appl Math , [0] D Stevaović, O spectral radius ad eergy of complete multipartite graphs, Ars Math Cotemp 9 015, [1] D B West, Itroductio to Graph Theory, Pretice Hall, New Delhi, 001 [] B Zhou, More o eergy ad laplacia eergy, MATCH Commu Math Comput Chem , [3] B Zhou, I Gutma ad T Aleksić, A ote o laplacia eergy of graphs, MATCH Commu Math Comput Chem , Departmet of Mathematics, MIT, Maipal Uiversity, Maipal address: gowthamhalgar@gmailcom address: sabithadsouza@maipaledu address: pgbhat@maipaledu
MORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES
Iraia Joural of Mathematical Scieces ad Iformatics Vol. 2, No. 2 (2007), pp 57-62 MORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES CHANDRASHEKAR ADIGA, ZEYNAB KHOSHBAKHT ad IVAN GUTMAN 1 DEPARTMENT
More informationSymmetric Division Deg Energy of a Graph
Turkish Joural of Aalysis ad Number Theory, 7, Vol, No 6, -9 Available olie at http://pubssciepubcom/tat//6/ Sciece ad Educatio Publishig DOI:69/tat--6- Symmetric Divisio Deg Eergy of a Graph K N Prakasha,
More informationBOUNDS FOR THE DISTANCE ENERGY OF A GRAPH
59 Kragujevac J. Math. 31 (2008) 59 68. BOUNDS FOR THE DISTANCE ENERGY OF A GRAPH Harishchadra S. Ramae 1, Deepak S. Revakar 1, Iva Gutma 2, Siddai Bhaskara Rao 3, B. Devadas Acharya 4 ad Haumappa B. Walikar
More informationLaplacian energy of a graph
Liear Algebra ad its Applicatios 414 (2006) 29 37 www.elsevier.com/locate/laa Laplacia eergy of a graph Iva Gutma a,, Bo Zhou b a Faculty of Sciece, Uiversity of Kragujevac, 34000 Kragujevac, P.O. Box
More informationSPECTRA OF GRAPH OPERATIONS BASED ON CORONA AND NEIGHBORHOOD CORONA OF GRAPH G AND K 1
JOURNAL OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4866, ISSN (o) 2303-4947 www.imvibl.org / JOURNALS / JOURNAL Vol. 5(2015), 55-69 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationEnergy of a Hypercube and its Complement
Iteratioal Joural of Algebra, Vol. 6, 01, o. 16, 799-805 Eergy of a Hypercube ad its Complemet Xiaoge Che School of Iformatio Sciece ad Techology, Zhajiag Normal Uiversity Zhajiag Guagdog, 54048 P.R. Chia
More informationBounds of Balanced Laplacian Energy of a Complete Bipartite Graph
Iteratioal Joural of Computatioal Itelligece Research ISSN 0973-1873 Volume 13, Number 5 (2017), pp. 1157-1165 Research Idia Publicatios http://www.ripublicatio.com Bouds of Balaced Laplacia Eergy of a
More informationNew Bounds for the Resolvent Energy of Graphs
SCIENTIFIC PUBLICATIONS OF THE STATE UNIVERSITY OF NOVI PAZAR SER A: APPL MATH INFORM AND MECH vol 9, 2 207), 87-9 New Bouds for the Resolvet Eergy of Graphs E H Zogić, E R Glogić Abstract: The resolvet
More informationDETERMINANT AND PSEUDO-DETERMINANT OF ADJACENCY MATRICES OF DERIVED GRAPHS
Iteratioal Joural Computer Applicatios (0975-8887) Volume * - No*, 016 DETERMINANT AND PSEUDO-DETERMINANT OF ADJACENCY MATRICES OF DERIVED GRAPHS Rajedra P Bharathi College, PG ad Research Cetre, Bharathiagara,
More informationLaplacian Minimum covering Randić Energy of a Graph
Commuicatios i Mathematics ad Applicatios Vol 9 No pp 67 88 8 ISSN 975-867 (olie); 976-595 (prit) Published by RGN Publicatios http://wwwrgpublicatioscom Laplacia Miimum coverig Radić Eergy of a Graph
More informationMalaya J. Mat. 4(3)(2016) Reciprocal Graphs
Malaya J Mat 43)06) 380 387 Reciprocal Graphs G Idulal a, ad AVijayakumar b a Departmet of Mathematics, StAloysius College, Edathua, Alappuzha - 689573, Idia b Departmet of Mathematics, Cochi Uiversity
More informationMiskolc Mathematical Notes HU e-issn Bounds for Laplacian-type graph energies. Ivan Gutman, Emina Milovanovic, and Igor Milovanovic
Miskolc Mathematical Notes HU e-issn 787-43 Vol. 6 (05), No, pp. 95-03 DOI: 0.854/MMN.05.40 Bouds for Laplacia-type graph eergies Iva Gutma, Emia Milovaovic, ad Igor Milovaovic Miskolc Mathematical Notes
More informationOn Energy and Laplacian Energy of Graphs
Electroic Joural of Liear Algebra Volume 31 Volume 31: 016 Article 15 016 O Eergy ad Laplacia Eergy of Graphs Kikar Ch Das Sugkyukwa Uiversity, kikardas003@googlemailcom Seyed Ahmad Mojalal Sugkyukwa Uiversity,
More informationResistance matrix and q-laplacian of a unicyclic graph
Resistace matrix ad q-laplacia of a uicyclic graph R. B. Bapat Idia Statistical Istitute New Delhi, 110016, Idia e-mail: rbb@isid.ac.i Abstract: The resistace distace betwee two vertices of a graph ca
More informationSome Trigonometric Identities Involving Fibonacci and Lucas Numbers
1 2 3 47 6 23 11 Joural of Iteger Sequeces, Vol. 12 (2009), Article 09.8.4 Some Trigoometric Idetities Ivolvig Fiboacci ad Lucas Numbers Kh. Bibak ad M. H. Shirdareh Haghighi Departmet of Mathematics Shiraz
More informationDisjoint unions of complete graphs characterized by their Laplacian spectrum
Electroic Joural of Liear Algebra Volume 18 Volume 18 (009) Article 56 009 Disjoit uios of complete graphs characterized by their Laplacia spectrum Romai Boulet boulet@uiv-tlse.fr Follow this ad additioal
More informationON GRAPHS WITH THREE DISTINCT LAPLACIAN EIGENVALUES. 1 Introduction
Appl. Math. J. Chiese Uiv. Ser. B 2007, 22(4): 478-484 ON GRAPHS WITH THREE DISTINCT LAPLACIAN EIGENVALUES Wag Yi 1 Fa Yizheg 1 Ta Yigyig 1,2 Abstract. I this paper, a equivalet coditio of a graph G with
More informationGraphs with few distinct distance eigenvalues irrespective of the diameters
Electroic Joural of Liear Algebra Volume 29 Special volume for Proceedigs of the Iteratioal Coferece o Liear Algebra ad its Applicatios dedicated to Professor Ravidra B. Bapat Article 13 2015 Graphs with
More informationRandić index, diameter and the average distance
Radić idex, diameter ad the average distace arxiv:0906.530v1 [math.co] 9 Ju 009 Xueliag Li, Yogtag Shi Ceter for Combiatorics ad LPMC-TJKLC Nakai Uiversity, Tiaji 300071, Chia lxl@akai.edu.c; shi@cfc.akai.edu.c
More informationON THE NUMBER OF LAPLACIAN EIGENVALUES OF TREES SMALLER THAN TWO. Lingling Zhou, Bo Zhou* and Zhibin Du 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol 19, No 1, pp 65-75, February 015 DOI: 1011650/tjm190154411 This paper is available olie at http://jouraltaiwamathsocorgtw ON THE NUMBER OF LAPLACIAN EIGENVALUES OF
More informationLinear combinations of graph eigenvalues
Electroic Joural of Liear Algebra Volume 5 Volume 5 2006 Article 27 2006 Liear combiatios of graph eigevalues Vladimir ikiforov vikifrv@memphis.edu Follow this ad additioal works at: http://repository.uwyo.edu/ela
More informationON BANHATTI AND ZAGREB INDICES
JOURNAL OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4866, ISSN (o) 2303-4947 www.imvibl.org /JOURNALS / JOURNAL Vol. 7(2017), 53-67 DOI: 10.7251/JIMVI1701053G Former BULLETIN OF THE
More informationThe Multiplicative Zagreb Indices of Products of Graphs
Iteratioal Joural of Mathematics Research. ISSN 0976-5840 Volume 8, Number (06), pp. 6-69 Iteratioal Research Publicatio House http://www.irphouse.com The Multiplicative Zagreb Idices of Products of Graphs
More informationOn Net-Regular Signed Graphs
Iteratioal J.Math. Combi. Vol.1(2016), 57-64 O Net-Regular Siged Graphs Nuta G.Nayak Departmet of Mathematics ad Statistics S. S. Dempo College of Commerce ad Ecoomics, Goa, Idia E-mail: ayakuta@yahoo.com
More informationEstrada Index of Benzenoid Hydrocarbons
Estrada Idex of Bezeoid Hydrocarbos Iva Gutma ad Slavko Radeković Faculty of Sciece Uiversity of Kragujevac P. O. Box 60 34000 Kragujevac Serbia Reprit requests to Prof. I. G.; Fax: +381 34 335040; E-mail:
More informationFormulas for the Number of Spanning Trees in a Maximal Planar Map
Applied Mathematical Scieces Vol. 5 011 o. 64 3147-3159 Formulas for the Number of Spaig Trees i a Maximal Plaar Map A. Modabish D. Lotfi ad M. El Marraki Departmet of Computer Scieces Faculty of Scieces
More informationSome inequalities for the Kirchhoff index of graphs
Malaya Joural of Matematik Vol 6 No 349-353 08 https://doiorg/06637/mjm060/0008 Some iequalities for the Kirchhoff idex of graphs Igor Milovaovic * Emia Milovaovic Marja Matejic ad Edi Glogic Abstract
More informationMinimum Equitable Dominating Randić Energy of a Graph
Iteratioal JMath Combi Vol28), 97-8 Miimum Equitable Domiatig Raić Eergy of a Graph Rajera P Bharathi College, PG a Research Cetre, Bharathiagara, 57 422, Iia) RRagaraja DOS i Mathematics, Uiversity of
More informationThe Forcing Domination Number of Hamiltonian Cubic Graphs
Iteratioal J.Math. Combi. Vol.2 2009), 53-57 The Forcig Domiatio Number of Hamiltoia Cubic Graphs H.Abdollahzadeh Ahagar Departmet of Mathematics, Uiversity of Mysore, Maasagagotri, Mysore- 570006 Pushpalatha
More informationEQUITABLE DOMINATING CHROMATIC SETS IN GRAPHS. Sethu Institute of Technology Kariapatti, Tamilnadu, INDIA 2 Department of Mathematics
Iteratioal Joural of Pure ad Applied Mathematics Volume 104 No. 2 2015, 193-202 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v104i2.4
More informationOn size multipartite Ramsey numbers for stars versus paths and cycles
Electroic Joural of Graph Theory ad Applicatios 5 (1) (2017), 4 50 O size multipartite Ramsey umbers for stars versus paths ad cycles Aie Lusiai 1, Edy Tri Baskoro, Suhadi Wido Saputro Combiatorial Mathematics
More informationAlliance Partition Number in Graphs
Alliace Partitio Number i Graphs Lida Eroh Departmet of Mathematics Uiversity of Wiscosi Oshkosh, Oshkosh, WI email: eroh@uwoshedu, phoe: (90)44-7343 ad Ralucca Gera Departmet of Applied Mathematics Naval
More informationLaplacian Sum-Eccentricity Energy of a Graph. 1. Introduction
Mathematics Iterdiscipliary Research 2 (2017) 209 219 Laplacia Sum-Eccetricity Eergy of a Graph Biligiriragaiah Sharada, Mohammad Issa Sowaity ad Iva Gutma Abstract We itroduce the Laplacia sum-eccetricity
More informationAN INTRODUCTION TO SPECTRAL GRAPH THEORY
AN INTRODUCTION TO SPECTRAL GRAPH THEORY JIAQI JIANG Abstract. Spectral graph theory is the study of properties of the Laplacia matrix or adjacecy matrix associated with a graph. I this paper, we focus
More informationNumber of Spanning Trees of Circulant Graphs C 6n and their Applications
Joural of Mathematics ad Statistics 8 (): 4-3, 0 ISSN 549-3644 0 Sciece Publicatios Number of Spaig Trees of Circulat Graphs C ad their Applicatios Daoud, S.N. Departmet of Mathematics, Faculty of Sciece,
More informationAbsolutely Harmonious Labeling of Graphs
Iteratioal J.Math. Combi. Vol. (011), 40-51 Absolutely Harmoious Labelig of Graphs M.Seeivasa (Sri Paramakalyai College, Alwarkurichi-6741, Idia) A.Lourdusamy (St.Xavier s College (Autoomous), Palayamkottai,
More informationBI-INDUCED SUBGRAPHS AND STABILITY NUMBER *
Yugoslav Joural of Operatios Research 14 (2004), Number 1, 27-32 BI-INDUCED SUBGRAPHS AND STABILITY NUMBER * I E ZVEROVICH, O I ZVEROVICH RUTCOR Rutgers Ceter for Operatios Research, Rutgers Uiversity,
More informationThe path polynomial of a complete graph
Electroic Joural of Liear Algebra Volume 10 Article 12 2003 The path polyomial of a complete graph C M da Foseca cmf@matucpt Follow this ad additioal wors at: http://repositoryuwyoedu/ela Recommeded Citatio
More informationLinear Algebra and its Applications
Liear Algebra ad its Applicatios 433 (2010) 1148 1153 Cotets lists available at ScieceDirect Liear Algebra ad its Applicatios joural homepage: www.elsevier.com/locate/laa The algebraic coectivity of graphs
More informationLinear chord diagrams with long chords
Liear chord diagrams with log chords Everett Sulliva Departmet of Mathematics Dartmouth College Haover New Hampshire, U.S.A. everett..sulliva@dartmouth.edu Submitted: Feb 7, 2017; Accepted: Oct 7, 2017;
More informationMath 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix
Math 778S Spectral Graph Theory Hadout #3: Eigevalues of Adjacecy Matrix The Cartesia product (deoted by G H) of two simple graphs G ad H has the vertex-set V (G) V (H). For ay u, v V (G) ad x, y V (H),
More informationResolvent Estrada Index of Cycles and Paths
SCIENTIFIC PUBLICATIONS OF THE STATE UNIVERSITY OF NOVI PAZAR SER. A: APPL. MATH. INFORM. AND MECH. vol. 8, 1 (216), 1-1. Resolvet Estrada Idex of Cycles ad Paths Bo Deg, Shouzhog Wag, Iva Gutma Abstract:
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationREGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS
REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS LIVIU I. NICOLAESCU ABSTRACT. We ivestigate the geeralized covergece ad sums of series of the form P at P (x, where P R[x], a R,, ad T : R[x] R[x]
More informationThe McClelland approximation and the distribution of -electron molecular orbital energy levels
J. Serb. Chem. Soc. 7 (10) 967 973 (007) UDC 54 74+537.87:53.74+539.194 JSCS 369 Origial scietific paper The McClellad approximatio ad the distributio of -electro molecular orbital eergy levels IVAN GUTMAN*
More informationEQUIENERGETIC COMPLEMENT GRAPHS
67 Kragujevac J. Sc. 7 005) 67-74. EQUIENERGETIC COMPLEMENT GRAPHS Harshchadra S. Ramae a, Iva Gutma b, Haumappa B. Walkar c ad Sabeea B. Halkar c a Departmet of Mathematcs, Gogte Isttute of Techology,
More informationA Note On The Exponential Of A Matrix Whose Elements Are All 1
Applied Mathematics E-Notes, 8(208), 92-99 c ISSN 607-250 Available free at mirror sites of http://wwwmaththuedutw/ ame/ A Note O The Expoetial Of A Matrix Whose Elemets Are All Reza Farhadia Received
More informationACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory
1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.
More informationMath 4707 Spring 2018 (Darij Grinberg): homework set 4 page 1
Math 4707 Sprig 2018 Darij Griberg): homewor set 4 page 1 Math 4707 Sprig 2018 Darij Griberg): homewor set 4 due date: Wedesday 11 April 2018 at the begiig of class, or before that by email or moodle Please
More informationON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS
ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary
More informationOn the Number of 1-factors of Bipartite Graphs
Math Sci Lett 2 No 3 181-187 (2013) 181 Mathematical Scieces Letters A Iteratioal Joural http://dxdoiorg/1012785/msl/020306 O the Number of 1-factors of Bipartite Graphs Mehmet Akbulak 1 ad Ahmet Öteleş
More informationarxiv: v1 [math.nt] 10 Dec 2014
A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a
More informationOn the Jacobsthal-Lucas Numbers by Matrix Method 1
It J Cotemp Math Scieces, Vol 3, 2008, o 33, 1629-1633 O the Jacobsthal-Lucas Numbers by Matrix Method 1 Fikri Köke ad Durmuş Bozkurt Selçuk Uiversity, Faculty of Art ad Sciece Departmet of Mathematics,
More informationPairs of disjoint q-element subsets far from each other
Pairs of disjoit q-elemet subsets far from each other Hikoe Eomoto Departmet of Mathematics, Keio Uiversity 3-14-1 Hiyoshi, Kohoku-Ku, Yokohama, 223 Japa, eomoto@math.keio.ac.jp Gyula O.H. Katoa Alfréd
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationOn distance matrices and Laplacians
Liear Algebra ad its Applicatios 40 2005 93 209 www.elsevier.com/locate/laa O distace matrices ad Laplacias R. Bapat a,, S.J. Kirklad b,2,m.neuma c,,3 a Idia Statistical Istitute, New Delhi 006, Idia b
More informationWeakly Connected Closed Geodetic Numbers of Graphs
Iteratioal Joural of Mathematical Aalysis Vol 10, 016, o 6, 57-70 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/ijma01651193 Weakly Coected Closed Geodetic Numbers of Graphs Rachel M Pataga 1, Imelda
More informationPAijpam.eu IRREGULAR SET COLORINGS OF GRAPHS
Iteratioal Joural of Pure ad Applied Mathematics Volume 109 No. 7 016, 143-150 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://www.ijpam.eu doi: 10.173/ijpam.v109i7.18 PAijpam.eu
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More informationCHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS
22 CHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS 2.1 INTRODUCTION Various types of domiatio have bee studied by several authors ad more tha 75 models of domiatio are listed i the appedix
More informationOn Nonsingularity of Saddle Point Matrices. with Vectors of Ones
Iteratioal Joural of Algebra, Vol. 2, 2008, o. 4, 197-204 O Nosigularity of Saddle Poit Matrices with Vectors of Oes Tadeusz Ostrowski Istitute of Maagemet The State Vocatioal Uiversity -400 Gorzów, Polad
More informationA class of spectral bounds for Max k-cut
A class of spectral bouds for Max k-cut Miguel F. Ajos, José Neto December 07 Abstract Let G be a udirected ad edge-weighted simple graph. I this paper we itroduce a class of bouds for the maximum k-cut
More informationLarge holes in quasi-random graphs
Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,
More informationCARLEMAN INTEGRAL OPERATORS AS MULTIPLICATION OPERATORS AND PERTURBATION THEORY
Kragujevac Joural of Mathematics Volume 41(1) (2017), Pages 71 80. CARLEMAN INTEGRAL OPERATORS AS MULTIPLICATION OPERATORS AND PERTURBATION THEORY S. M. BAHRI 1 Abstract. I this paper we itroduce a multiplicatio
More informationAdjacent vertex distinguishing total coloring of tensor product of graphs
America Iteratioal Joural of Available olie at http://wwwiasiret Research i Sciece Techology Egieerig & Mathematics ISSN Prit): 38-3491 ISSN Olie): 38-3580 ISSN CD-ROM): 38-369 AIJRSTEM is a refereed idexed
More informationγ-max Labelings of Graphs
γ-max Labeligs of Graphs Supapor Saduakdee 1 & Varaoot Khemmai 1 Departmet of Mathematics, Sriakhariwirot Uiversity, Bagkok, Thailad Joural of Mathematics Research; Vol. 9, No. 1; February 017 ISSN 1916-9795
More informationTRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES. 1. Introduction
Math Appl 6 2017, 143 150 DOI: 1013164/ma201709 TRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES PANKAJ KUMAR DAS ad LALIT K VASHISHT Abstract We preset some iequality/equality for traces of Hadamard
More informationOn Orlicz N-frames. 1 Introduction. Renu Chugh 1,, Shashank Goel 2
Joural of Advaced Research i Pure Mathematics Olie ISSN: 1943-2380 Vol. 3, Issue. 1, 2010, pp. 104-110 doi: 10.5373/jarpm.473.061810 O Orlicz N-frames Reu Chugh 1,, Shashak Goel 2 1 Departmet of Mathematics,
More informationExpected Norms of Zero-One Polynomials
DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page Sheet of Caad. Math. Bull. Vol. XX (Y, ZZZZ pp. 0 0 Expected Norms of Zero-Oe Polyomials Peter Borwei, Kwok-Kwog Stephe Choi, ad Idris Mercer
More informationarxiv: v1 [cs.dm] 6 May 2017
B-partitios, applicatio to determiat ad permaet of graphs Raveer Sigh R B Bapat arxiv:17050517v1 [csdm] 6 May 017 May 9, 017 Abstract Let G be a graphdirected or udirected havig k umber of blocks A B-partitio
More informationk-equitable mean labeling
Joural of Algorithms ad Comutatio joural homeage: htt://jac.ut.ac.ir k-euitable mea labelig P.Jeyathi 1 1 Deartmet of Mathematics, Govidammal Aditaar College for Wome, Tiruchedur- 628 215,Idia ABSTRACT
More informationON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS
Joural of Algebra, Number Theory: Advaces ad Applicatios Volume, Number, 00, Pages 7-89 ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS OLCAY KARAATLI ad REFİK KESKİN Departmet
More informationSOME FINITE SIMPLE GROUPS OF LIE TYPE C n ( q) ARE UNIQUELY DETERMINED BY THEIR ELEMENT ORDERS AND THEIR ORDER
Joural of Algebra, Nuber Theory: Advaces ad Applicatios Volue, Nuber, 010, Pages 57-69 SOME FINITE SIMPLE GROUPS OF LIE TYPE C ( q) ARE UNIQUELY DETERMINED BY THEIR ELEMENT ORDERS AND THEIR ORDER School
More informationMaximising the number of independent sets in connected graphs
Maximisig the umber of idepedet sets i coected graphs Floria Leher ad Stepha Wager September 30, 015 A Turá coected graph TC,α is obtaied from α cliques of size α or α by joiig all cliques by a edge to
More informationDouble Dominating Energy of Some Graphs
Iter. J. Fuzzy Mathematcal Archve Vol. 4, No., 04, -7 ISSN: 30 34 (P), 30 350 (ole) Publshed o 5 March 04 www.researchmathsc.org Iteratoal Joural of V.Kaladev ad G.Sharmla Dev P.G & Research Departmet
More informationA q-analogue of some binomial coefficient identities of Y. Sun
A -aalogue of some biomial coefficiet idetities of Y. Su arxiv:008.469v2 [math.co] 5 Apr 20 Victor J. W. Guo ad Da-Mei Yag 2 Departmet of Mathematics, East Chia Normal Uiversity Shaghai 200062, People
More informationThe Local Harmonious Chromatic Problem
The 7th Workshop o Combiatorial Mathematics ad Computatio Theory The Local Harmoious Chromatic Problem Yue Li Wag 1,, Tsog Wuu Li ad Li Yua Wag 1 Departmet of Iformatio Maagemet, Natioal Taiwa Uiversity
More informationR Index of Some Graphs
Aals of Pure ad Applied athematics Vol 6, No, 08, 6-67 IN: 79-087X P), 79-0888olie) Published o Jauary 08 wwwresearchmathsciorg DOI: http://dxdoiorg/0457/apam6a8 Aals of Departmet of athematicseethalakshmi
More informationCompositions of Random Functions on a Finite Set
Compositios of Radom Fuctios o a Fiite Set Aviash Dalal MCS Departmet, Drexel Uiversity Philadelphia, Pa. 904 ADalal@drexel.edu Eric Schmutz Drexel Uiversity ad Swarthmore College Philadelphia, Pa., 904
More informationBi-Magic labeling of Interval valued Fuzzy Graph
Advaces i Fuzzy Mathematics. ISSN 0973-533X Volume 1, Number 3 (017), pp. 645-656 Research Idia Publicatios http://www.ripublicatio.com Bi-Magic labelig of Iterval valued Fuzzy Graph K.Ameeal Bibi 1 ad
More informationDecoupling Zeros of Positive Discrete-Time Linear Systems*
Circuits ad Systems,,, 4-48 doi:.436/cs..7 Published Olie October (http://www.scirp.org/oural/cs) Decouplig Zeros of Positive Discrete-Time Liear Systems* bstract Tadeusz Kaczorek Faculty of Electrical
More informationThe spectral radius and the maximum degree of irregular graphs arxiv:math/ v1 [math.co] 22 Feb 2007
The spectral radius ad the maximum degree of irregular graphs arxiv:math/0702627v1 [math.co] 22 Feb 2007 Sebastia M. Cioabă Departmet of Mathematics Uiversity of Califoria, Sa Diego La Jolla, CA 92093-0112
More informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationPAijpam.eu ON TENSOR PRODUCT DECOMPOSITION
Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314
More informationCMSE 820: Math. Foundations of Data Sci.
Lecture 17 8.4 Weighted path graphs Take from [10, Lecture 3] As alluded to at the ed of the previous sectio, we ow aalyze weighted path graphs. To that ed, we prove the followig: Theorem 6 (Fiedler).
More informationLAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS
Kragujevac Journal of Mathematics Volume 39() (015), Pages 193 05. LAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS HARISHCHANDRA S. RAMANE 1, GOURAMMA A. GUDODAGI 1,
More informationrespectively. The Estrada index of the graph G is defined
Askari et al. Joural of Iequalities ad Applicatios (016) 016:10 DOI 10.1186/s13660-016-1061-9 RESEARCH Ope Access Seidel-Estrada idex Jalal Askari1, Ali Iramaesh1* ad Kikar Ch Das * Correspodece: iramaesh@modares.ac.ir
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationRELATION BETWEEN ENERGY AND LAPLACIAN ENERGY
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 59 (200) 343-354 ISSN 0340-6253 RELATION BETWEEN ENERGY AND LAPLACIAN ENERGY Ivan Gutman, a NairMariaMaiadeAbreu,
More informationA NOTE ON INVARIANT SETS OF ITERATED FUNCTION SYSTEMS
Acta Math. Hugar., 2007 DOI: 10.1007/s10474-007-7013-6 A NOTE ON INVARIANT SETS OF ITERATED FUNCTION SYSTEMS L. L. STACHÓ ad L. I. SZABÓ Bolyai Istitute, Uiversity of Szeged, Aradi vértaúk tere 1, H-6720
More informationON RADIO NUMBER OF STACKED-BOOK GRAPHS arxiv: v1 [math.co] 2 Jan 2019
ON RADIO NUMBER OF STACKED-BOOK GRAPHS arxiv:1901.00355v1 [math.co] Ja 019 TAYO CHARLES ADEFOKUN 1 AND DEBORAH OLAYIDE AJAYI Abstract. A Stacked-book graph G m, results from the Cartesia product of a stargraphs
More informationA new error bound for linear complementarity problems for B-matrices
Electroic Joural of Liear Algebra Volume 3 Volume 3: (206) Article 33 206 A ew error boud for liear complemetarity problems for B-matrices Chaoqia Li Yua Uiversity, lichaoqia@yueduc Megtig Ga Shaorog Yag
More informationBounds for the Extreme Eigenvalues Using the Trace and Determinant
ISSN 746-7659, Eglad, UK Joural of Iformatio ad Computig Sciece Vol 4, No, 9, pp 49-55 Bouds for the Etreme Eigevalues Usig the Trace ad Determiat Qi Zhog, +, Tig-Zhu Huag School of pplied Mathematics,
More informationIntroducing a Novel Bivariate Generalized Skew-Symmetric Normal Distribution
Joural of mathematics ad computer Sciece 7 (03) 66-7 Article history: Received April 03 Accepted May 03 Available olie Jue 03 Itroducig a Novel Bivariate Geeralized Skew-Symmetric Normal Distributio Behrouz
More informationRamanujan s Famous Partition Congruences
Ope Sciece Joural of Mathematics ad Applicatio 6; 4(): - http://wwwopescieceoliecom/joural/osjma ISSN:8-494 (Prit); ISSN:8-494 (Olie) Ramauja s Famous Partitio Cogrueces Md Fazlee Hossai, Nil Rata Bhattacharjee,
More informationLONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES
J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >
More informationA NOTE ON PASCAL S MATRIX. Gi-Sang Cheon, Jin-Soo Kim and Haeng-Won Yoon
J Korea Soc Math Educ Ser B: Pure Appl Math 6(1999), o 2 121 127 A NOTE ON PASCAL S MATRIX Gi-Sag Cheo, Ji-Soo Kim ad Haeg-Wo Yoo Abstract We ca get the Pascal s matrix of order by takig the first rows
More informationBETWEEN QUASICONVEX AND CONVEX SET-VALUED MAPPINGS. 1. Introduction. Throughout the paper we denote by X a linear space and by Y a topological linear
BETWEEN QUASICONVEX AND CONVEX SET-VALUED MAPPINGS Abstract. The aim of this paper is to give sufficiet coditios for a quasicovex setvalued mappig to be covex. I particular, we recover several kow characterizatios
More informationA remark on p-summing norms of operators
A remark o p-summig orms of operators Artem Zvavitch Abstract. I this paper we improve a result of W. B. Johso ad G. Schechtma by provig that the p-summig orm of ay operator with -dimesioal domai ca be
More informationEigenvalue localization for complex matrices
Electroic Joural of Liear Algebra Volume 7 Article 1070 014 Eigevalue localizatio for complex matrices Ibrahim Halil Gumus Adıyama Uiversity, igumus@adiyama.edu.tr Omar Hirzallah Hashemite Uiversity, o.hirzal@hu.edu.jo
More information