Minimum and Maximum Resistance Status of Unicyclic Graphs  

作　　者：Meiqun CHENG Bo ZHOU 

机构地区：[1]School of Mathematical Sciences,South China Normal University,Guangdong 510631,P.R.China

出　　处：《Journal of Mathematical Research with Applications》2022年第5期463-475,共13页数学研究及应用（英文版）

基　　金：Supported by the National Natural Science Foundation of China(Grant No.12071158)。

摘　　要：The resistance status of a vertex of a connected graph is the sum of the resistance distance between this vertex and any other vertices of the graph. The minimum(maximum,resp.) resistance status of a connected graph is the minimum(maximum, resp.) resistance status of all vertices of the graph. In this paper, we determine the extremal values and corresponding extremal graphs for the minimum(maximum, resp.) resistance status over all unicyclic graphs of fixed order, and we also discuss the dependence of the minimum(maximum, resp.) resistance status on the girth of unicyclic graphs.

关 键 词：minimum resistance status maximum resistance status resistance distance unicyclic graph extremal graph 

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