on reverse degree distance of unicyclic graphs

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...

On Reverse Degree Distance of Unicyclic Graphs

The reverse degree distance of a connected graph G is defined in discrete mathematical chemistry as D(G) = 2(n− 1)md− ∑

degree resistance distance of unicyclic graphs

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 resista...

Degree distance of unicyclic and bicyclic graphs

Degree Resistance Distance of Unicyclic Graphs

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.

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.