On the eccentric distance sum of graphsA survey

来源 :The 12th Meeting of the International Academy of Mathematica | 被引量 : 0次 | 上传用户:fngdi
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  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 corresponding vertex and dG(u,v)is the distance between the vertices u and v.The eccentric distance sum is a novel graph invariant with vast potential in structure activity/property relationships.
其他文献
  We present some transformations on the complements of graphs that increase or decrease the matching numbers accordingly.As an application,we apply these res
会议
  ZWP 光栅衍射成像仪是我们研发的新仪器,利用它,可以开展有关双光栅色散-汇合光谱成象的新实验。双光栅色散-汇合光谱成像效应是将两光栅组合为一系统,使物光波通过该系统中
  With the rapid development of structural nanotechnology,DNA and natural polypeptides have become versatile building blocks for assembling well-ordered struc
会议
  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
会议