期刊文献+

只有一条最长路的树的Wiener指标

Wiener Index of Trees with Exactly One Longest Path
下载PDF
导出
摘要 一个图的Winer指标是指图的所有顶点对的距离之和.本文确定了所有只有一条最长路的n阶树中(n>19)Wiener指标从第一小至第五小的树. The Wiener index of a connected graph was defined as the sum of distances between all unor dered pairs of its vertices. The Wiener indices from the smallest to the fifth-small trees in all n order ( n 〉19) trees which had exactly one longest path were determined.
作者 宋梦华
机构地区 集美大学理学院
出处 《集美大学学报(自然科学版)》 CAS 2014年第3期215-218,共4页 Journal of Jimei University:Natural Science
关键词 WIENER指标 直径 毛毛虫树 最长路 Wiener index diameter caterpillar longest path
  • 相关文献

参考文献14

  • 1WIENER H. Structual determination of paraffin boiling points[J].Journal of the American Chemical Society,1947.17-20.
  • 2DOBRYNIN A A,ENTRINGER R,GUTMAN I. Wiener index of trees:theory and applications[J].ACTA APPLICANDAE MATHEMATICAE,2001.211-249.
  • 3DU Z,ZHOU B. Minimum Wiener indices of trees and unicyclic graphs of given matching number[J].Match Commun Math Comput Chem,2010.101-112.
  • 4LIU H,PAN X F. On the Wiener index of trees with fixed diameter[J].Match Commun Math Comput Chem,2008.85-94.
  • 5WANG S,GUO X. Trees with extremal Wiener indices[J].Match Commun Math Comput Chem,2008.609-622.
  • 6YOU Z,LIU B. Note on the minimal Wiener index of connected graphs with n vertices and radius r[J].Match Commun Math Comput Chem,2011.343-344.
  • 7LIN H. Extremal Wiener index of trees with all degrees odd[J].Match Commun Math Comput Chem,2013.287-292.
  • 8SCHMUCK N S,WAGNER S G,WANG H. Greedy trees,caterpillars,and Wiener-type graph invariants[J].Match Commun Math Comput Chem,2012.273-292.
  • 9ZHANG X D. The Wiener index of trees with given degree sequences[J].Match Commun Math Comput Chem,2008.623-644.
  • 10ZHANG X D,LIU Y,HAN M X. Maximum Wiener index of trees with given degree sequence[J].Match Commun Math Comput Chem,2010.661-682.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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