Randić index, diameter and the average distance
|
|
- Laura Pitts
- 5 years ago
- Views:
Transcription
1 Radić idex, diameter ad the average distace arxiv: v1 [math.co] 9 Ju 009 Xueliag Li, Yogtag Shi Ceter for Combiatorics ad LPMC-TJKLC Nakai Uiversity, Tiaji , Chia lxl@akai.edu.c; shi@cfc.akai.edu.c Abstract The Radić idex of a graph G, deoted by R(G), is defied as the sum of 1/ d(u)d(v) over all edges uv of G, where d(u) deotes the degree of a vertex u i G. I this paper, we partially solve two cojectures o the Radić idex R(G) with relatios to the diameter D(G) ad the average distace µ(g) of a graph G. We prove that for ay coected graph G of order with miimum degree δ(g), if δ(g) 5, the R(G) D(G) +1 ; if δ(g) /5 ad 15, R(G) D(G) 3+ ad R(G) µ(g). Furthermore, for ay arbitrary real umber ε (0 < ε < 1), if δ(g) ε, the R(G) D(G) 3+ R(G) µ(g) hold for sufficietly large. Keywords: Radić idex; diameter; average distace; miimum degree AMS Subject Classificatio (000): 05C1, 05C35, 9E10. ad 1 Itroductio The Radić idex R(G) of a (molecular) graph G was itroduced by the chemist Mila Radić [8] i 1975 as the sum of 1/ d(u)d(v) over all edges uv of G, where d(u) deotes the degree of a vertex u i G, i.e., R(G) = 1. Recetly, may results o the extremal theory of the Radić d(u)d(v) uv E(G) idex have bee reported (see [6]). Supported by NSFC No , PCSIRT ad the 973 program. 1
2 Giveacoected, simpleadudirectedgraphg = (V,E)oforder. The distace betwee two vertices u ad v i G, deoted by d G (u,v) (or d(u,v) for short), is the legth of a shortest path coectig u ad v i G. The diameter D(G) of G is the maximum distace d(u,v) over all pairs of vertices u ad v of G. The average distace µ(g), a iterestig graph-theoretical ivariat, is defied as the average value of the distaces betwee all pairs of vertices of G, i.e., u,v V µ(g) = ( d(u,v). ) For termiology ad otatios ot give here, we refer to the book of Body ad Murty []. There are may results o the relatios betwee the Radć idex ad some other graph ivariats, such as the miimum degree, the chromatic umber, the radius, ad so o. I this paper, we will cosider the relatios of the Radić idex with the diameter ad the average distace. I [1], Aouchiche, Hase ad Zheg proposed the followig cojecture o the relatio betwee the Radić idex ad the diameter. Cojecture 1 ([1]) For ay coected graph of order 3 with Radić idex R(G) ad diameter D(G), R(G)D(G) +1 with equalities if ad oly if G = P. ad R(G) D(G) 3+, I [4], Fajtlowicz proposed the followig cojecture o the relatio betwee the Radić idex ad the average distace. Cojecture ([4]) For all coected graphs G, R(G) µ(g), where µ(g) deotes the average distace of G. I the followig, we will prove that for ay coected graph G of order with miimum degree δ(g), if δ(g) 5, the R(G) D(G) +1 ; if δ(g) /5 ad 15, R(G) 3+ D(G) ad R(G) µ(g). Furthermore, for ay arbitrary real umber ε (0 < ε < 1), if δ(g) ε, the R(G) 3+ D(G) ad R(G) µ(g) hold for sufficietly large.
3 Mai results At first, we recall some lemmas which will be used i the sequel. Lemma 1 (Erdös et al. [3]) Let G be a coected graph with vertices ad miimum degree δ(g). The D(G) 3 δ(g)+1 1. Lemma (Kouider ad Wikler [5]) If G is a graph with vertices ad miimum degree δ(g), the the average distace satisfyig µ(g) δ(g)+1 +. Lemma 3 (Li, Liu ad Liu [7]) Let G be a graph of order with miimum degree δ(g) = k. The R(G) k(k1) + k(k) if k (1) k(1) (p)(p1) (1) + p(p+k) k + p(p) if k > k(1) where p is a iteger give as follows: if 0 (mod 4) or if 1 (mod 4) ad k is eve if 1 (mod 4) ad k is odd p = or + if (mod 4) ad k is eve if (mod 4) ad k is odd or if 3 (mod 4) ad k is eve if 3 (mod 4) ad k is odd. It is easy to see from Lemma 3 that p is amog the umbers, 1,, +1 ad +. Lemma 4 Deote by g(,k) = k1 g(,k) k (1) k(1). The for 1 k /, Proof. If 3k, we ca directly obtai that g(,k) > 0. Now we assume that k < 3k. The ( ) k 1 3k g(,k) = = 1 k 1 1 ( 1 k 1 3 k + ). 1 1 k 3
4 Sice g(, k) for, we have ( 1 = k ) k k ( 1 < k k ) k < 0, k Therefore, the lemma follows. g(,k) > g(, ) = 1 0. Theorem 1 For ay coected graph G of order with miimum degree δ(g). (1) If δ(g) 5, the R(G)D(G) +1 ; () If δ(g) /5 ad 15, the R(G) 3+. Furthermore, for D(G) ay arbitrary real umber ε (0 < ε < 1), if δ(g) ε, the R(G) 3+ D(G) holds for sufficietly large. (3) If δ(g) /5 ad 15, the R(G) µ(g). Furthermore, for ay arbitrary real umber ε (0 < ε < 1), if δ(g) ε, the R(G) µ(g) holds for sufficietly large. Proof. Let G be a coected graph of order with miimum degree δ(g) = k. By Lemma 1, we have D(G) 3 k+1 1. (1) Suppose k 5, we will show R(G)D(G) +1. We cosider the followig two cases: Case 1. k. By Lemma 3, we oly eed to cosider the followig iequality, k(k 1) (1) + k(k) 3 k(1) k Let k(k 1) f(,k) = (1) + k(k) 3 k(1) k The by Lemma 4, f(,k) > k1 (1) + 3k k(1) f(,5) = (5) + 3 > (1) Case. < k 1. 4 > 0. If k 5, we have f(,k)
5 Let q(,p) = (p)(p1) + p(p+k) + p(p). I the followig, we will (1) k k(1) show that for every p {, 1,, +1, + }, I fact, if p =, deote by Notice that q(,p) 3 k h(,k) = q(, ) 3 k = (+) ()(k (+)) (1) 8k 4 k(1) 3 k h(, k) = 4 4 8k 8k k(1) + 3) (k +1) > 0, sice 8k 8k k(1), i.e., k 1. Thus, we have h(,k) > h(, ) = (+) 8(1) + 4 (1) > = By some calculatios, we have that > 0 for 8. For 4 7, it is easy to verify h(, ) > 0. I a similar way, we ca verify the iequality for each of the cases for p = 1,, +1 or +. The details are omitted. Let () Similarly, we cosider the followig two cases: Case 1. k. By Lemma 3, we oly eed to cosider the followig iequality, k(k 1) (1) + k(k) ( ) 3 3+ k(1) k f(,k) = k(k 1) (1) + k(k) ( ) 3 3+ k(1) k
6 The by Lemma 4, f(,k) > k1 (1) + 3k k(1) > 0. If k 5 ad 15, we have f(,k) f(, 5 ) = (5) (145)(3+ ) (1) 5 5(1) > 0. Actually, forayarbitrarypositiveumber ε(0 < ε < 1), (1)(+5) if k ε, the f(,k) > f(,ε) > ε(1ε) ( 3 > 0 for ε(1) sufficietly large. Case. < k 1. Let q(,p) = (p)(p1) (1) + p(p+k) k show that for every p {, 1,, +1, +}, ( ) 3 3+ q(,p) k ) 3+ ε+1 + k(1) p(p). I the followig, we will I fact, if p =, deote by h(,k) = q(, ( ) 3 3+ ) k +1 1 = (+) ()(k (+)) Notice that 8(1) ( 3 k +1 1 h(, k) 8k ) 3+. > 4 4 8k 8k k(1) > 0, sice 8k 8k k(1), i.e., k 1. Thus, we have 4 k(1) h(,k) > h(, ) = (+) 8(1) + 4 (1) ( ) > = (1). By some calculatios, we have that (1) (61) > 0 for 5. I a similar way, we ca verify the iequality for each of the cases for p = 1,, +1 or +. The details are omitted. 6
7 By the method similar to (), we ca obtai the result of (3). The proof is ow complete. Refereces [1] M. Aouchiche, P. Hase, M. Zheg, Variable eighborhood search for extremal graphs 19: Further cojectures ad results about the Radić idex, MATCH Commu. Math. Comput. Chem. 58 (007), [] J.A. Body, U.S.R. Murty, Graph Theory, Spriger, 008. [3] P. Erdös, J. Pach, R. Pollack, Z. Tuza, Radius, diameter, ad miimum degree, J. Combi. Theory Ser. B 47(1989), [4] S. Fajtlowicz, O cojectures of Graffiti, Discrete Math. 7(1988), [5] M. Kouider, P. Wikler, Mea distace ad miimum degree, J. Graph Theory 5 (1997) [6] X. Li, I. Gutma, Mathematical Aspects of Radić-Type Molecular Structure Descriptors, Mathematical Chemistry Moographs No.1, Kragujevac, 006. [7] X. Li, B. Liu, J. Liu, Complete solutio to a cojecture o Radić idex, Europea J. Operatioal Research (009), doi: /j.ejor [8] M. Radić, O characterizatio of molecular brachig, J. Amer. Chem. Soc. 97 (1975),
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 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 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 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 informationThe log-behavior of n p(n) and n p(n)/n
Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity
More informationRADIO NUMBER FOR CROSS PRODUCT P n (P 2 ) Gyeongsang National University Jinju, , KOREA 2,4 Department of Mathematics
Iteratioal Joural of Pure ad Applied Mathematics Volume 97 No. 4 014, 515-55 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/10.173/ijpam.v97i4.11
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 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 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 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 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 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 informationON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES
Publ. Math. Debrece 8504, o. 3-4, 85 95. ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES QING-HU HOU*, ZHI-WEI SUN** AND HAOMIN WEN Abstract. We cofirm Su s cojecture that F / F 4 is strictly decreasig
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 informationLAPLACIAN ENERGY OF GENERALIZED COMPLEMENTS OF A GRAPH
Kragujevac Joural of Mathematics Volume 4 018, Pages 99 315 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,,
More informationProof of a conjecture of Amdeberhan and Moll on a divisibility property of binomial coefficients
Proof of a cojecture of Amdeberha ad Moll o a divisibility property of biomial coefficiets Qua-Hui Yag School of Mathematics ad Statistics Najig Uiversity of Iformatio Sciece ad Techology Najig, PR Chia
More informationOn the Spectrum of Unitary Finite Euclidean Graphs
ESI The Erwi Schrödiger Iteratioal Boltzmagasse 9 Istitute for Mathematical Physics A-1090 Wie, Austria O the Spectrum of Uitary Fiite Euclidea Graphs Si Li Le Ah Vih Viea, Preprit ESI 2038 (2008) July
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 informationarxiv: v3 [math.co] 6 Aug 2014
NEAR PERFECT MATCHINGS IN -UNIFORM HYPERGRAPHS arxiv:1404.1136v3 [math.co] 6 Aug 2014 JIE HAN Abstract. Let H be a -uiform hypergraph o vertices where is a sufficietly large iteger ot divisible by. We
More informationarxiv: v2 [math.co] 5 Nov 2015
Upper bounds for the achromatic and coloring numbers of a graph arxiv:1511.00537v2 [math.co] 5 Nov 2015 Baoyindureng Wu College of Mathematics and System Sciences, Xinjiang University Urumqi, Xinjiang
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 informationk-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction
Acta Math. Uiv. Comeiaae Vol. LXXXVI, 2 (2017), pp. 279 286 279 k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c N. IRMAK ad M. ALP Abstract. The k-geeralized Fiboacci sequece { F (k)
More informationBINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n
BINOMIAL PREDICTORS VLADIMIR SHEVELEV arxiv:0907.3302v2 [math.nt] 22 Jul 2009 Abstract. For oegative itegers, k, cosider the set A,k = { [0, 1,..., ] : 2 k ( ). Let the biary epasio of + 1 be: + 1 = 2
More informationThe 4-Nicol Numbers Having Five Different Prime Divisors
1 2 3 47 6 23 11 Joural of Iteger Sequeces, Vol. 14 (2011), Article 11.7.2 The 4-Nicol Numbers Havig Five Differet Prime Divisors Qiao-Xiao Ji ad Mi Tag 1 Departmet of Mathematics Ahui Normal Uiversity
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 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 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 informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
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 informationOn matchings in hypergraphs
O matchigs i hypergraphs Peter Frakl Tokyo, Japa peter.frakl@gmail.com Tomasz Luczak Adam Mickiewicz Uiversity Faculty of Mathematics ad CS Pozań, Polad ad Emory Uiversity Departmet of Mathematics ad CS
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 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 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 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 informationPROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.
Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6
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 informationOn Divisibility concerning Binomial Coefficients
A talk give at the Natioal Chiao Tug Uiversity (Hsichu, Taiwa; August 5, 2010 O Divisibility cocerig Biomial Coefficiets Zhi-Wei Su Najig Uiversity Najig 210093, P. R. Chia zwsu@ju.edu.c http://math.ju.edu.c/
More information#A51 INTEGERS 14 (2014) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES
#A5 INTEGERS 4 (24) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES Kohtaro Imatomi Graduate School of Mathematics, Kyushu Uiversity, Nishi-ku, Fukuoka, Japa k-imatomi@math.kyushu-u.ac.p
More informationSome remarks for codes and lattices over imaginary quadratic
Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract
More informationTHE LONELY RUNNER PROBLEM FOR MANY RUNNERS. Artūras Dubickas Vilnius University, Lithuania
GLASNIK MATEMATIČKI Vol. 46(66)(2011), 25 30 THE LONELY RUNNER PROBLEM FOR MANY RUNNERS Artūras Dubickas Vilius Uiversity, Lithuaia Abstract. The loely ruer cojecture asserts that for ay positive iteger
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 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 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 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 informationPI Polynomial of V-Phenylenic Nanotubes and Nanotori
It J Mol Sci 008, 9, 9-34 Full Research Paper Iteratioal Joural of Molecular Scieces ISSN 4-0067 008 by MDPI http://wwwmdpiorg/ijms PI Polyomial of V-Pheyleic Naotubes ad Naotori Vahid Alamia, Amir Bahrami,*
More informationFundamental Theorem of Algebra. Yvonne Lai March 2010
Fudametal Theorem of Algebra Yvoe Lai March 010 We prove the Fudametal Theorem of Algebra: Fudametal Theorem of Algebra. Let f be a o-costat polyomial with real coefficiets. The f has at least oe complex
More informationOn Summability Factors for N, p n k
Advaces i Dyamical Systems ad Applicatios. ISSN 0973-532 Volume Number 2006, pp. 79 89 c Research Idia Publicatios http://www.ripublicatio.com/adsa.htm O Summability Factors for N, p B.E. Rhoades Departmet
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 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 informationLargest families without an r-fork
Largest families without a r-for Aalisa De Bois Uiversity of Salero Salero, Italy debois@math.it Gyula O.H. Katoa Réyi Istitute Budapest, Hugary ohatoa@reyi.hu Itroductio Let [] = {,,..., } be a fiite
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 informationDominating Sets and Domination Polynomials of Square Of Cycles
IOSR Joural of Mathematics IOSR-JM) ISSN: 78-78. Volume 3, Issue 4 Sep-Oct. 01), PP 04-14 www.iosrjourals.org Domiatig Sets ad Domiatio Polyomials of Square Of Cycles A. Vijaya 1, K. Lal Gipso 1 Assistat
More informationThe Wiener Index for Weighted Trees
WSEAS TRANSACTIONS o MATHEMATICS Yajig Wag, Yumei Hu The Wieer Idex for Weighted Trees Yajig Wag Departmet of mathematics Tiaji Uiversity Tiaji 30007 P. R. Chia wyjwagya@16.com Yumei Hu* Departmet of mathematics
More informationarxiv: v1 [math.nt] 28 Apr 2014
Proof of a supercogruece cojectured by Z.-H. Su Victor J. W. Guo Departmet of Mathematics, Shaghai Key Laboratory of PMMP, East Chia Normal Uiversity, 500 Dogchua Rd., Shaghai 0041, People s Republic of
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 informationLecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound
Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee
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 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 informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationSOME SEQUENCE SPACES DEFINED BY ORLICZ FUNCTIONS
ARCHIVU ATHEATICU BRNO Tomus 40 2004, 33 40 SOE SEQUENCE SPACES DEFINED BY ORLICZ FUNCTIONS E. SAVAŞ AND R. SAVAŞ Abstract. I this paper we itroduce a ew cocept of λ-strog covergece with respect to a Orlicz
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 informationApplication to Random Graphs
A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let
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 informationThe log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences
Aales Mathematicae et Iformaticae 43 2014 pp. 3 12 http://ami.etf.hu The log-cocavity ad log-covexity properties associated to hyperpell ad hyperpell-lucas sequeces Moussa Ahmia ab, Hacèe Belbachir b,
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 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 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 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 information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More information(p, q)-type BETA FUNCTIONS OF SECOND KIND
Adv. Oper. Theory 6, o., 34 46 http://doi.org/.34/aot.69. ISSN: 538-5X electroic http://aot-math.org p, q-type BETA FUNCTIONS OF SECOND KIND ALI ARAL ad VIJAY GUPTA Commuicated by A. Kamisa Abstract. I
More informationTechnische Universität Ilmenau Institut für Mathematik
Techische Uiversität Ilmeau Istitut für Mathematik Preprit No. M 07/09 Domiatio i graphs of miimum degree at least two ad large girth Löwestei, Christia; Rautebach, Dieter 2007 Impressum: Hrsg.: Leiter
More informationAPPROXIMATION BY BERNSTEIN-CHLODOWSKY POLYNOMIALS
Hacettepe Joural of Mathematics ad Statistics Volume 32 (2003), 1 5 APPROXIMATION BY BERNSTEIN-CHLODOWSKY POLYNOMIALS E. İbili Received 27/06/2002 : Accepted 17/03/2003 Abstract The weighted approximatio
More informationBijective Proofs of Gould s and Rothe s Identities
ESI The Erwi Schrödiger Iteratioal Boltzmagasse 9 Istitute for Mathematical Physics A-1090 Wie, Austria Bijective Proofs of Gould s ad Rothe s Idetities Victor J. W. Guo Viea, Preprit ESI 2072 (2008 November
More informationCOMMON FIXED POINT THEOREMS VIA w-distance
Bulleti of Mathematical Aalysis ad Applicatios ISSN: 1821-1291, URL: http://www.bmathaa.org Volume 3 Issue 3, Pages 182-189 COMMON FIXED POINT THEOREMS VIA w-distance (COMMUNICATED BY DENNY H. LEUNG) SUSHANTA
More informationRADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify
Example 1 Simplify 1.2A Radical Operatios a) 4 2 b) 16 1 2 c) 16 d) 2 e) 8 1 f) 8 What is the relatioship betwee a, b, c? What is the relatioship betwee d, e, f? If x = a, the x = = th root theorems: RADICAL
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 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 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 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 informationA Simplified Binet Formula for k-generalized Fibonacci Numbers
A Simplified Biet Formula for k-geeralized Fiboacci Numbers Gregory P. B. Dresde Departmet of Mathematics Washigto ad Lee Uiversity Lexigto, VA 440 dresdeg@wlu.edu Zhaohui Du Shaghai, Chia zhao.hui.du@gmail.com
More informationON STATISTICAL CONVERGENCE AND STATISTICAL MONOTONICITY
Aales Uiv. Sci. Budapest., Sect. Comp. 39 (203) 257 270 ON STATISTICAL CONVERGENCE AND STATISTICAL MONOTONICITY E. Kaya (Mersi, Turkey) M. Kucukasla (Mersi, Turkey) R. Wager (Paderbor, Germay) Dedicated
More information<, if ε > 0 2nloglogn. =, if ε < 0.
GLASNIK MATEMATIČKI Vol. 52(72)(207), 35 360 THE DAVIS-GUT LAW FOR INDEPENDENT AND IDENTICALLY DISTRIBUTED BANACH SPACE VALUED RANDOM ELEMENTS Pigya Che, Migyag Zhag ad Adrew Rosalsky Jia Uversity, P.
More information# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.
Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.
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 informationSimple Polygons of Maximum Perimeter Contained in a Unit Disk
Discrete Comput Geom (009) 1: 08 15 DOI 10.1007/s005-008-9093-7 Simple Polygos of Maximum Perimeter Cotaied i a Uit Disk Charles Audet Pierre Hase Frédéric Messie Received: 18 September 007 / Revised:
More information2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.
CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.
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 informationBest bounds for dispersion of ratio block sequences for certain subsets of integers
Aales Mathematicae et Iformaticae 49 (08 pp. 55 60 doi: 0.33039/ami.08.05.006 http://ami.ui-eszterhazy.hu Best bouds for dispersio of ratio block sequeces for certai subsets of itegers József Bukor Peter
More informationA Note on Matrix Rigidity
A Note o Matrix Rigidity Joel Friedma Departmet of Computer Sciece Priceto Uiversity Priceto, NJ 08544 Jue 25, 1990 Revised October 25, 1991 Abstract I this paper we give a explicit costructio of matrices
More informationDECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES
DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES DANIELA KÜHN AND DERYK OSTHUS Abstract. I 1973 Bermod, Germa, Heydema ad Sotteau cojectured that if divides (, the the complete
More informationMath 2112 Solutions Assignment 5
Math 2112 Solutios Assigmet 5 5.1.1 Idicate which of the followig relatioships are true ad which are false: a. Z Q b. R Q c. Q Z d. Z Z Z e. Q R Q f. Q Z Q g. Z R Z h. Z Q Z a. True. Every positive iteger
More informationIndependence number of graphs with a prescribed number of cliques
Idepedece umber of graphs with a prescribed umber of cliques Tom Bohma Dhruv Mubayi Abstract We cosider the followig problem posed by Erdős i 1962. Suppose that G is a -vertex graph where the umber of
More informationSOME RESULTS ON FIBONACCI QUATERNIONS MUTHULAKSHMI R. IYER Indian Statistical Institute, Calcutta, India
SOME RESULTS ON FIBONACCI QUATERNIONS MUTHULAKSHMI R. IYER Idia Statistical Istitute, Calcutta, Idia 1. INTRODUCTION Recetly the author derived some results about geeralized Fiboacci Numbers [3J. I the
More informationNAME: ALGEBRA 350 BLOCK 7. Simplifying Radicals Packet PART 1: ROOTS
NAME: ALGEBRA 50 BLOCK 7 DATE: Simplifyig Radicals Packet PART 1: ROOTS READ: A square root of a umber b is a solutio of the equatio x = b. Every positive umber b has two square roots, deoted b ad b or
More informationAn analog of the arithmetic triangle obtained by replacing the products by the least common multiples
arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationNEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE
UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece
More informationBoundaries and the James theorem
Boudaries ad the James theorem L. Vesely 1. Itroductio The followig theorem is importat ad well kow. All spaces cosidered here are real ormed or Baach spaces. Give a ormed space X, we deote by B X ad S
More informationif > 6 is sucietly large). Nevertheless, Pichasi has show that the umber of radial poits of a o-colliear set P of poits i the plae that lie i a halfpl
Radial Poits i the Plae Jaos Pach y Micha Sharir z Jauary 6, 00 Abstract A radial poit for a ite set P i the plae is a poit q 6 P with the property that each lie coectig q to a poit of P passes through
More information