Resonance Graphs of Fullerenes

来源 :The 12th Meeting of the International Academy of Mathematica | 被引量 : 0次 | 上传用户:liqund7h
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  A fullerene G is a 3-regular plane graph consisting only of pentagonal and hexagonal faces.The resonance graph R(G)of G reflects the structure of its perfect matchings.The Zhang-Zhang polynomial of a fullerene is a counting polynomial of resonant structures called Clar covers.The cube polynomial is a counting polynomial of induced hypercubes in a graph.
其他文献
会议
会议
会议
会议
会议
  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
会议
会议
  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
会议
  Discrete molecular models,using the tools of discrete mathematics,have many advantages,however,for a more detailed description of molecules,exhibiting many,
会议
  Let G be a graph of order n and λ1,λ2,…,λn the eigenvalues of G.The energy of G is defined as(E(G)=Σn k=1 |λk|.A well-known result on the energy of gr
会议