首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一类树的Hosoya指标序列
引用本文:高玉芬.一类树的Hosoya指标序列[J].湖南文理学院学报(自然科学版),2007,19(2):25-26,45.
作者姓名:高玉芬
作者单位:青海大学基础部,青海西宁810017
摘    要:一个图的Hosoya指标是图的所有独立边子集的数目之和,包括空集.T(n1,n2,n3)表示只有一个3度点,三个1度点且唯一3度点到三个一度点的路长分别是n1,n2,n3的树.用代数组合的方法研究了这类树的Hosoya指标值.给出了这类树在一定条件下依Hosoya指标值的排序.

关 键 词:拓扑指标    Hosoya-指标  类树  指标值  序列  Trees  Class  Sequence  排序  条件  研究  方法  组合  代数  空集
文章编号:1672-6146(2007)02-0025-02
修稿时间:2007-04-10

Hosoya Index Sequence of a Class of Trees
GAO Yu-fen.Hosoya Index Sequence of a Class of Trees[J].Journal of Hunan University of Arts and Science:Natural Science Edition,2007,19(2):25-26,45.
Authors:GAO Yu-fen
Institution:Department of Basic Research, Qinghai University, Xining Qinghai 810017
Abstract:The Hosoya index of a graph is the number of all indepent edge subsets of a graph, By T ( n1 , n2 , n3 ) denotes a tree with a vertex v of degree 3 and three vertices of degree 1 such that the distances from v to the three vertices of degree 1 are n1 , n2 ,n3 , respectively. In the paper, we study the Hosoya index of tree T ( n1 , n2 , n3 ) and give the order of T ( n1 , n2 , n3 ) by its Hosya index.
Keywords:topological index  Tree  Hosoya index
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号