Randi(c)connectivity indices of trees with maximum degree at least 3

来源 :The 12th Meeting of the International Academy of Mathematica | 被引量 : 0次 | 上传用户:cuitlcm
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  We investigate trees with maximum degree at least 3.Among them,the ones that admit maximum Randic Connectivity Index(RCI)Value are identified.We further apply the result to a certain type of unicyclic graph.Applications in bioinformatics will be discussed.
其他文献
  Necessary and sufficient conditions for a simple and connected graph are given in terms of the order and size of the graph as well as the numbers ni of vert
会议
  Proteins are the most advanced nanostructures,defined by the sequence of amino acids.Nature provides a limited number of protein folds,which have been optim
会议
会议
会议
会议
  With the completion of the sequencing of the genomes of human and other species,the field of analysis of genomic sequences is becoming very important tasks
会议
  The eccentric distance sum(EDS)of a connected graph G is defined as ξd(G)=Σv∈VG(εG(u)+εG(v))dG(u,v),where εG(·)is the eccentricity of the correspondi
会议
  In this research,we investigate Randic Connectivity Indices(RCI)and energy matrices of certaincycle based graphs.Explicit formulas for the RCI values are gi
会议
会议