首页 | 本学科首页   官方微博 | 高级检索  
     检索      

图的电阻距离的一个下界可达性
引用本文:李祎,王燕.图的电阻距离的一个下界可达性[J].烟台大学学报(自然科学与工程版),2012(4):235-238.
作者姓名:李祎  王燕
作者单位:烟台大学数学与信息科学学院
基金项目:山东自然科学基金资助项目(ZR2011AM005)
摘    要:连通图中任意2个顶点之间的电阻距离定义为将图中每条边用单位电阻代替后所得电网络中这2个节点之间的有效电阻.应用Rayleigh单调性法则等电网络理论以及网孔分析法,本文刻画了图的电阻距离的一个下界可达的充要条件.

关 键 词:电阻距离  Rayleigh单调性法则  网孔分析法

Sharpness of a Lower Bound for Resistance Distances of Graphs
LI Yi,WANG Yan.Sharpness of a Lower Bound for Resistance Distances of Graphs[J].Journal of Yantai University(Natural Science and Engineering edirion),2012(4):235-238.
Authors:LI Yi  WANG Yan
Institution:(School of Mathematics and Information Science,Yantai University,Yantai 264005,China)
Abstract:The resistance distance between any two vertices of a connected graph is defined as the effective resistance between the corresponding nodes in the electrical network constructed from the graph by replacing each edge with a unit resistor. By using electrical network laws such as Rayleigh' s short-cut principle and mesh current method, necessary and sufficient condition is characterized in this paper that a lower bound on the resistance distance between a pair of vertices is obtained.
Keywords:resistance distance  Rayleigh' s short-cut principle  mesh analysis method
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号