Further results on the reciprocal degree distance of graphs

Shuchao Li (), Huihui Zhang and Minjie Zhang
Additional contact information
Shuchao Li: Central China Normal University
Huihui Zhang: Central China Normal University
Minjie Zhang: Hubei Institute of Technology

Journal of Combinatorial Optimization, 2016, vol. 31, issue 2, No 11, 648-668

Abstract: Abstract The reciprocal degree distance of a simple connected graph $$G=(V_G, E_G)$$ G = ( V G , E G ) is defined as $$\bar{R}(G)=\sum _{u,v \in V_G}(\delta _G(u)+\delta _G(v))\frac{1}{d_G(u,v)}$$ R ¯ ( G ) = ∑ u , v ∈ V G ( δ G ( u ) + δ G ( v ) ) 1 d G ( u , v ) , where $$\delta _G(u)$$ δ G ( u ) is the vertex degree of $$u$$ u , and $$d_G(u,v)$$ d G ( u , v ) is the distance between $$u$$ u and $$v$$ v in $$G$$ G . The reciprocal degree distance is an additive weight version of the Harary index, which is defined as $$H(G)=\sum _{u,v \in V_G}\frac{1}{d_G(u,v)}$$ H ( G ) = ∑ u , v ∈ V G 1 d G ( u , v ) . In this paper, the extremal $$\bar{R}$$ R ¯ -values on several types of important graphs are considered. The graph with the maximum $$\bar{R}$$ R ¯ -value among all the simple connected graphs of diameter $$d$$ d is determined. Among the connected bipartite graphs of order $$n$$ n , the graph with a given matching number (resp. vertex connectivity) having the maximum $$\bar{R}$$ R ¯ -value is characterized. Finally, sharp upper bounds on $$\bar{R}$$ R ¯ -value among all simple connected outerplanar (resp. planar) graphs are determined.

Keywords: The reciprocal degree distance; Bipartite graph; Planar graph; Diameter; Matching number; Vertex-connectivity; 05C35; 05C12 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9780-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9780-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9780-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().