Let Gbe a connected graph with vertex set V(G). Then the degree resistance distance of Gis defined as DR(G)=∑{ u,v }⊆V(G)(d(u)+d(v))R(u,v), where d(u)is the degree of the vertex u, and R(u,v)is the degree resistance ...Let Gbe a connected graph with vertex set V(G). Then the degree resistance distance of Gis defined as DR(G)=∑{ u,v }⊆V(G)(d(u)+d(v))R(u,v), where d(u)is the degree of the vertex u, and R(u,v)is the degree resistance distance between uand vin graph G. A unicyclic graph is a connected graph with a unique cycle. In this paper, we characterize the unique graph with the third-maximum degree resistance distance among all unicyclic graphs with nvertices.展开更多
文摘Let Gbe a connected graph with vertex set V(G). Then the degree resistance distance of Gis defined as DR(G)=∑{ u,v }⊆V(G)(d(u)+d(v))R(u,v), where d(u)is the degree of the vertex u, and R(u,v)is the degree resistance distance between uand vin graph G. A unicyclic graph is a connected graph with a unique cycle. In this paper, we characterize the unique graph with the third-maximum degree resistance distance among all unicyclic graphs with nvertices.
