Bounds for the Kirchhoff Index of Bipartite Graphs英文文献资料.docVIP

HindawiPublishingCorporation JournalofAppliedMathematics Volume2012,ArticleID195242,9pages doi:10.1155/2012/195242 ResearchArticle BoundsfortheKirchhoffIndexofBipartiteGraphs YujunYang SchoolofMathematics andInformation Science,YantaiUniversity,Yantai264005,China Correspondence shouldbeaddressedtoYujunYang,yangyj@ Received1January2012;Accepted 10February2012 Academic Editor:MehmetSezer Copyright q2012YujunYang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use,distribution, andreproduction in anymedium,providedtheoriginalworkisproperlycited. A m,n-bipartite graph is a bipartite graph such that one bipartition has m vertices and the other bipartition has nvertices. The treedumbbell Dn,a,bconsists ofthe path P together n?a?b and bindependent vertices with aindependent vertices adjacent toonependent vertex ofP n?a?b adjacent totheother pendent vertex ofPn?a?b.Inthispaper,?rstly,weshow that, among m,n- thebipartitetreedumbbellgraphs mD≤mnn,, then?completem1/2bipartite,n?mgraph1/K2hasmaximal Kirchho?index. Then, m,n has minimal Kirchho? index and weshow that,among allbipartite graphs oforderl,thecomplete bipartite graph K has l/2,l?l/2 minimalKirchho?indexandthepathPlhasmaximalKirchho?index,respectively.Finally,bonds fortheKirchho?index ofm,n-bipartite graphs and bipartite graphs oforder lareobtained by computing theKirchho?indexoftheseextremalgraphs. 1.Introduction Let G be a connected graph with vertices labeled as v1,v2,...,vn. The distance between verticesviandvj,denotedbydGvi,vj,isthelengthofashortestpathbetweenthem.The famousWienerindexWG1 isthesumofdistancesbetweenallpairsofvertices,thatis    WG  dG vi,vj . 1.1 ij In1993,KleinandRandi′c2 introducedanewdistancefunctionnamedresistance distanceonthebasisofelectricalnetworktheory.TheyviewGasanelectricalnetworkN suchthateachedgeofGisassumedtobeaunitresistor.Then,theresistancedistancebetwe