联苯和多环烃的一些拓扑指数-运筹学与控制论专业论文.docxVIP

ABSTRACTLet ABSTRACT Let G=(V E)be simple，undirected graph．If each vertex of G repre- sents an atom of a molecule and each edge represents a chemical bond between the atoms respectively,then G is called an molecular graph．It is well known that the appearance and the development of graph theory are closely connect— ed with the research of chemical molecular graph．The study of molecular topological indices and the invariants of molecular graph is one of the most active area in the modern chemical graph theory．A molecular topological in- dex is from the set of molecular graphs to the set of real number that is each real number represents a molecular graph．For some topological properties of chemical molecular graph，many results have been achieved．The research of graph theory about them mainly focuses on theory of graph spectra，theory of extremal graph，matchings counting，counting problem，etc． In this paper，we focus on the extremal graphs and ordering problems respect to some topological indices．we will mainly discuss the matching ener— gY,Kirchoff-index，Hosoya-index and Merrifield-Simmons-index of polyphenyl chains and spiro chains． Here iS the main work in this paper： _!．matching energy In chapter two and chapter three，firstly,we study the matching energy of polyphenyl chains and spiro chains by some transformation- S of graphs，auxiliary graphs and inductive recursion．We show that if PPG is a polyphenyl chain of length n，then we have ME(Mn)ME(PPCn) ME(On)．We also study the order respect to matching energy of polyphenyl chains，and get the extremal graphs of the second minimal，the second maxi- mal matching energy in the polyphenyl chains of length扎．Secondly,we study the matching energy of spiro chains by some transformations of graphs，auxil— iary graphs．We get that if SPG is a six-membered ring spiro chain of length 竹，then we have ME(Mn)ME(SPCn)ME(On)．We also get the ex- tremal graphs of the minimum，the second minimal，the maximum，the second maximal matching energy of the