|
|
|
|
DEGREE RESISTANCE DISTANCE OF TREES WITH SOME GIVEN PARAMETERS
|
|
|
|
|
|
|
|
نویسنده
|
he fangguo ,jiang xinnong
|
|
منبع
|
transactions on combinatorics - 2018 - دوره : 7 - شماره : 4 - صفحه:11 -24
|
|
چکیده
|
The degree resistance distance of a graph g is dened as dr(g) = σі < j(d(vi)+d(vj))r(vi; vj ), where d(vi) is the degree of the vertex vi, and r(vi; vj) is the resistance distance between the vertices vi and vj . here we characterize the extremal graphs with respect to degree resistance distance among trees with given diameter, number of pendent vertices, independence number, covering number, and maximum degree, respectively.
|
|
کلیدواژه
|
Trees ,Degree resistance distance ,Diameter ,Covering number
|
|
آدرس
|
huanggang normal university, college of mathematics and physics, China, huazhong university of science and technology, college of life science and techonolgy, China
|
|
پست الکترونیکی
|
jiangxn88@hust.edu.cn
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|