DocumentCode
510241
Title
Minimal Merrifield-Simmons Index of 5-leaf-trees
Author
Ye, Chengfu
Author_Institution
Dept. of Math. & Inf. Sci., Qinghai Normal Univ., Xining, China
Volume
1
fYear
2009
fDate
11-14 Dec. 2009
Firstpage
264
Lastpage
267
Abstract
A tree T is called a r-leaf-tree if T has r pendent vertices. In this paper, we characterized trees with the second and third minimal Merrifield-Simmons index in the set of 5-leaf-trees of order n.
Keywords
trees (mathematics); 5 leaf trees; minimal Merrifield-Simmons index; r leaf tree; Bonding; Chemical compounds; Computational intelligence; Entropy; Hydrocarbons; Information science; Information security; Mathematics; Tree graphs; $5$-leaf-trees; Merrifield-Simmons index; trees;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security, 2009. CIS '09. International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-5411-2
Type
conf
DOI
10.1109/CIS.2009.89
Filename
5376598
Link To Document