On borderenergetic graphs

来源 :The 12th Meeting of the International Academy of Mathematica | 被引量 : 0次 | 上传用户:qq1256280577
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  A graph G is called borderenergetic if its energy ε(G)is equal to the energy of the complete graph of the same order n,i.e.,ε(G)= 2(n-1).This talk will survey the results on the borderenergetic graphs.We obtain several asymptotically tight bounds on the size of borderenergetic graphs.
其他文献
会议
会议
会议
会议
会议
  In this talk,we present our results on forcing numbers of graphs and some recent developments in forcing numbers of graphs.
会议
  Applications of discrete mathematics in the development of structural descriptors began in the middle of the twentieth century and the trend is continuingev
会议
会议
  The nullity of a graph is the multiplicity of the eigenvalue zero of its adjacency matrix.The nullity of graphs has not only the mathematical meaning but al
会议
  In this talk.I will present some results on the Minimal Haray index of graphs with several parameters.Also.I will report some recent results on the relation
会议