A recursion formula for resistance distance and its applications

来源 :The 12th Meeting of the International Academy of Mathematica | 被引量 : 0次 | 上传用户:dark_zj
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  Intrinsic metrics on a graph G have become of interest.Amongst these metrics are the common shortest-path metric,and also the "resistance distance",for which there are different equivalent definitions including that this distance is the net effective resistance Ω(i,j)between i,j∈V(G)when unit resistors are associated to each edge of G.And this net resistance is still a metric when there are different positive weights for the edges.
其他文献
会议
会议
会议
会议
会议
  Let G be a simple undirected graph and Gσ be the corresponding oriented graph of G with the orientation σ.The skew energy of Gσ,denoted by εs(Gσ),is de
会议
  The energy ε(G)of a simple graph G is the sum of absolute values of the eigenvalues of its adjacency matrix.The energy of line graph,the Laplacian energy a
会议
  We discuss the posterity of AutoGraphiX conjectures,i.e.,new concepts and new conjectures on chemical indices and proofs thereof since the first paper in th
会议
  We consider three measures of stability for benzenoids(or graphene patches): the number of Kekule structures(K),the Fries number(F),and the Clar number(C).M
会议
  The energy of a graph is the sum of the absolute values of its eigenvalues.We propose a new problem on graph energy change due to any single edge deletion.T
会议