The distance spectral radius of graphs with given number of odd vertices

来源 :The 12th Meeting of the International Academy of Mathematica | 被引量 : 0次 | 上传用户:saialmaster
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  The unique graphs with minimum distance spectral radius are determined in the set of connected graphs with given number of odd vertices and the unique trees with maximum distance spectral radius are determined in the set of trees with given number of odd vertices.The unique trees with maximum distance spectral radius are also determined in the class of trees with respectively given number of vertices of degree 3 and given number of vertices of degree at least 3,and the unique trees with respectively second minimum and second maximum distance spectral radius are determined in the class of trees with all vertices being odd.
其他文献
  In this talk,I will use recent mineral physics results to address possible seismic and geochemical heterogeneities in the deep Earths interior.Based on seis
会议
会议
会议
会议
会议
会议
会议
  The number of matchings(named Hosoya Index in chemistry),the number of perfect matchings(named Kecul(e)structure number in chemistry)and matching energy are
会议
会议