Degree Resistance Distance of Unicyclic Graphs

نویسندگان

  • Alireza Abdollahi
  • G. Yu
چکیده

Let G be a connected graph with vertex set V (G). The degree resistance distance of G is defined as DR(G) = ∑ fu,vg 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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On reverse degree distance of unicyclic graphs

The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...

متن کامل

Maximizing Kirchhoff index of unicyclic graphs with fixed maximum degree

The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph. Its considerable applications are found in a variety of fields. In this paper, we determine the maximum value of Kirchhoff index among the unicyclic graphs with fixed number of vertices and maximum degree, and characterize the corresponding extremal graph.

متن کامل

The second geometric-arithmetic index for trees and unicyclic graphs

Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...

متن کامل

Unicyclic and bicyclic graphs having minimum degree distance

In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degree distance are given. © 2007 Elsevier B.V. All rights reserved.

متن کامل

Leap Zagreb indices of trees and unicyclic graphs

By d(v|G) and d_2(v|G) are denoted the number of first and second neighborsof the vertex v of the graph G. The first, second, and third leap Zagreb indicesof G are defined asLM_1(G) = sum_{v in V(G)} d_2(v|G)^2, LM_2(G) = sum_{uv in E(G)} d_2(u|G) d_2(v|G),and LM_3(G) = sum_{v in V(G)} d(v|G) d_2(v|G), respectively. In this paper, we generalizethe results of Naji et al. [Commun. Combin. Optim. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012