Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs

Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs

The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let Un denote the set of unicyclic graphs with n vertices. We study the graph with maximum reciprocal degree resistanc...

Full description

Bibliographic Details
Main Authors: Gai-Xiang Cai, Xing-Xing Li, Gui-Dong Yu
Format: Article
Language:English
Published: Hindawi Limited 2020-01-01
Series:Discrete Dynamics in Nature and Society
Online Access:http://dx.doi.org/10.1155/2020/7318968
id doaj-ae4d207a8c30489c8fc97d46a5a7b6a2
record_format Article
spelling doaj-ae4d207a8c30489c8fc97d46a5a7b6a22020-11-25T03:50:06ZengHindawi LimitedDiscrete Dynamics in Nature and Society1026-02261607-887X2020-01-01202010.1155/2020/73189687318968Maximum Reciprocal Degree Resistance Distance Index of Unicyclic GraphsGai-Xiang Cai0Xing-Xing Li1Gui-Dong Yu2School of Mathematics and Physics, Anqing Normal University, Anqing 246133, ChinaSchool of Mathematics and Physics, Anqing Normal University, Anqing 246133, ChinaSchool of Mathematics and Physics, Anqing Normal University, Anqing 246133, ChinaThe reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let Un denote the set of unicyclic graphs with n vertices. We study the graph with maximum reciprocal degree resistance distance index among all graphs in Un and characterize the corresponding extremal graph.http://dx.doi.org/10.1155/2020/7318968
collection DOAJ
language English
format Article
sources DOAJ
author Gai-Xiang Cai
Xing-Xing Li
Gui-Dong Yu
spellingShingle Gai-Xiang Cai
Xing-Xing Li
Gui-Dong Yu
Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
Discrete Dynamics in Nature and Society
author_facet Gai-Xiang Cai
Xing-Xing Li
Gui-Dong Yu
author_sort Gai-Xiang Cai
title Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
title_short Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
title_full Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
title_fullStr Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
title_full_unstemmed Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
title_sort maximum reciprocal degree resistance distance index of unicyclic graphs
publisher Hindawi Limited
series Discrete Dynamics in Nature and Society
issn 1026-0226
1607-887X
publishDate 2020-01-01
description The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let Un denote the set of unicyclic graphs with n vertices. We study the graph with maximum reciprocal degree resistance distance index among all graphs in Un and characterize the corresponding extremal graph.
url http://dx.doi.org/10.1155/2020/7318968
work_keys_str_mv AT gaixiangcai maximumreciprocaldegreeresistancedistanceindexofunicyclicgraphs
AT xingxingli maximumreciprocaldegreeresistancedistanceindexofunicyclicgraphs
AT guidongyu maximumreciprocaldegreeresistancedistanceindexofunicyclicgraphs
_version_ 1715107314047909888

Similar Items