图的电阻距离的一个下界可达性  

Sharpness of a Lower Bound for Resistance Distances of Graphs

作　　者：李祎[1] 王燕[1] 

机构地区：[1]烟台大学数学与信息科学学院,山东烟台264005

出　　处：《烟台大学学报（自然科学与工程版）》2012年第4期235-238,共4页Journal of Yantai University(Natural Science and Engineering Edition)

基　　金：山东自然科学基金资助项目(ZR2011AM005)

摘　　要：连通图中任意2个顶点之间的电阻距离定义为将图中每条边用单位电阻代替后所得电网络中这2个节点之间的有效电阻.应用Rayleigh单调性法则等电网络理论以及网孔分析法,本文刻画了图的电阻距离的一个下界可达的充要条件.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.

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

分 类 号：O157.5[理学—数学]