期刊文献+

具有给定匹配大小的极小能量树 被引量:1

ON TREES WITH THE LEAST ENERGY AND A GIVEN SIZE OF MATCHING
原文传递
导出
摘要 共轭分子的π-电子总能量可通过其相应的分子图来计算,即相应图的邻接矩阵的 特征值的绝对值之和.本文给出了具有给定匹配大小的一类树图的最小能量值和次小能 量值,并给出了达到最小能量值和次小能量值的树的刻划. The total π- electron of a conjugated molecule(with the frame of HMO approximation) can be calculated by its molecular graph, i.e., the sum of the absolute values of the eigenvalues of a graph is called its energy. In this paper, the trees with a given size of matching that have the least and second smallest energies are characterized.
作者 侯耀平
出处 《系统科学与数学》 CSCD 北大核心 2003年第4期491-494,共4页 Journal of Systems Science and Mathematical Sciences
基金 国家自然科学基金(19971086)资助课题
关键词 共轭分子 能量树 分子图 矩阵 特征值 绝对值 匹配 Energy of a graph, tree, matching.
  • 相关文献

参考文献9

  • 1Cvetkovic D M, Doob M and Sachs H. The Spectral of Graphs-theory and Application. Academic Press, New York, 1980.
  • 2Gutman I and Polansky O E. Mathematical Concepts in Organic Chemistry. Springer, Berlin,1986.
  • 3Gutman I. Acyclic conjugated molecules, trees and their energies. Journal of Mathematical Chemistry, 1987, 1: 123-143.
  • 4Gutman I, etc. Variable neighborhood search for extremal graphs, 2. Finding graphs with extremal energy. J Chem Inform Computer Sci , 1999, 39: 984-996.
  • 5Zhang Fuji and Li Huaien. On acyclic conjugated molecules with minimal energies. Discret Appl Math, 1999, 92: 71-84.
  • 6Gutman I and Hou Yaoping. Bipartite unicyclic graphs with the greatest energy. Communication in Math and Computer Chemistry, 2001, 43: 17-28.
  • 7Hou Yaoping. Unicyclic graphs with minimal energy. J Math Chem, 2001, 29: 163-168.
  • 8Hou Yaoping. Bicyclic graphs with minimal energy. Linear and Multilinear Algebra, 2001, 49:347-354.
  • 9Hou Yaoping and Li Jiongsheng. Bounds on the largest eigenvalues of trees with a given size of matching. Linear Algebra and Its Applications, 2002, 342: 203-217.

同被引文献16

  • 1王霄霞,郭晓峰.关于具有给定非悬挂边数的树的极小能量(英文)[J].数学研究,2006,39(2):109-116. 被引量:1
  • 2CVETKOVIC D M,DOOB M H S.Spectra of graphstheory and application[M].New York:AcademicPress,1980.
  • 3GUTMAN I,POLANSKY O.Mathematical concepts inorganic chemistry[M].Berlin:Springer-Verlag,1986.
  • 4唐熬庆,江元声.分子轨道图形理论[M].北京:科学出版社,1980.
  • 5CAPOROSSI G,CVETKOVIC D,GUTMAN I.Variableneighborhood search for extremal graphs.2.findinggraphs with extremal energy[J].Journal of ChemicalInformation and Computer Sciences,1999,39:984-996.
  • 6GUTMAN I.Acyclic systems with extremal Hückelπ-electron energy[J].Theoretica Chimica Acta,1977,45:79-87.
  • 7GUTMAN I,ZHANG F.On the ordering of graphs withrespect to their matching numbers[J].Discrete AppliedMathematics,1986,15(1):25-33.
  • 8LI N N,LI S C.On the extremal energies of trees[J].MATCH-Communications in Mathematical and inComputer Chemistry,2008,59(2):291-314.
  • 9WANG W H,KANG L Y.Ordering of the trees byminimal energies[J].Journal of MathematicalChemistry,2010,47(3):937-958.
  • 10ZHANG F,LI H.On acyclic conjugated molecules withminimal energies[J].Discrete Applied Mathematics,1999,92(1):71-84.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部