[1] ZHANG He-ping,ZHANG Fu-ji.Perfect Matching of Polyomino Graphs [J].Graphs and Combinatorics,1997,13:295-304.[2] JOHN P,SACHS H,ZERNTIZ H.Counting Perfect Matching in Polyominoes with Appliations to the Dimer Problem [J].Zastosowania Matematyki (Appl. Math.),1987,19:465-477.[3] KASTELEYN P W.The Statistics of Dimer on a Lattice I.,the Number of Dimer Arrangments on a Quadratic Lattice [J].Physica,1961,27:1 209-1 225.[4] PLUMMER M D.Matching Thoery a Samper:From Denes Konig to the Present [J].Discrete Math.,1992,100:177-219.[5] RANDIC′ M.On Characterization of Molecular Branching [J].J. Amer. Chen. Soc.,1975,97:6 609-6 615.[6] BOLLOB?#S B,ERD?;S P,SAKAR A.Extremal Graphs for Weights [J].Discrete Math.,1999,200:5-19.[7] HU Y,LI X,YUAN Y.Trees with Minimum General Randic′ Index [J].Match Commun. Math. Compt. Chem.,2001,52:119-128.[8] WU B,ZHANG L.Unicyclic Graphs with Minimum Randic′ Index [J].Match Commun. Math. Compt. Chem.,2005,54:455-464.[9] LI X,YANG Y T.Sharp Bounds for the General Randic′ Index [J].Match Commun.Math. Compt. Chem.,2004,51:155-166.