|
|
|
|
Degree resistance distance of unicyclic graphs
|
|
|
|
|
|
|
|
نویسنده
|
Gutman Ivan ,Feng Lihua ,Yu Guihai
|
|
منبع
|
transactions on combinatorics - 2012 - دوره : 1 - شماره : 2 - صفحه:27 -40
|
|
چکیده
|
Let g be a connected graph with vertex set v (g). the degree resistance distance of g is defined as dr(g) = σ{u;v} subseteq v(g)[d(u)+d(v)]r(u; v), where d(u) is the degree of vertex u, and r u; v) denotes the resistance distance between u and v. in this paper, we characterize n-vertex unicyclic graphs having minimum and second minimum degree resistance distance
|
|
کلیدواژه
|
Resistance distance (in graph); degree distance; degree resistance distance
|
|
آدرس
|
University of Kragujevac, Faculty of Science, Serbia, Central South University, Department of Mathematics, China. Shandong Institute of Business and Technology, School of Mathematics, China, Central South University, Department of Mathematics, China. Shandong Institute of Business and Technology, School of Mathematics, China
|
|
پست الکترونیکی
|
yuguihai@126.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|