Degree resistance distance of unicyclic graphs
عنوان مقاله: Degree resistance distance of unicyclic graphs
شناسه ملی مقاله: JR_COMB-1-2_003
منتشر شده در در سال 1391
شناسه ملی مقاله: JR_COMB-1-2_003
منتشر شده در در سال 1391
مشخصات نویسندگان مقاله:
Ivan Gutman - University of Kragujevac Kragujevac, Serbia
Linhua Feng - Department of Mathematics, Central South University
Guihai Yu - Department of Mathematics, Central South University
خلاصه مقاله:
Ivan Gutman - University of Kragujevac Kragujevac, Serbia
Linhua Feng - Department of Mathematics, Central South University
Guihai Yu - Department of Mathematics, Central South University
Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as D_R(G) = \sum_{\{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
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1319361/