Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications

Shuchao Li () and Xian Meng ()
Additional contact information
Shuchao Li: Central China Normal University
Xian Meng: Central China Normal University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 3, No 6, 468-488

Abstract: Abstract Let $$G=(V_G, E_G)$$ G = ( V G , E G ) be a simple connected graph. The reciprocal degree distance of $$G$$ G is defined as $$\bar{R}(G)=\sum _{\{u,v\}\subseteq V_G}(d_G(u)+d_G(v))\frac{1}{d_G(u,v)}=\sum _{u\in V_G}d_G(u)\hat{D}_G(u),$$ R ¯ ( G ) = ∑ { u , v } ⊆ V G ( d G ( u ) + d G ( v ) ) 1 d G ( u , v ) = ∑ u ∈ V G d G ( u ) D ^ G ( u ) , where $$\hat{D}_G(u)=\sum _{v\in V_G\setminus \{u\}}\frac{1}{d_G(u,v)}$$ D ^ G ( u ) = ∑ v ∈ V G \ { u } 1 d G ( u , v ) is the sum of reciprocal distances from the vertex $$u.$$ u . This novel invariant is in fact the modification of the Harary index in which the contributions of vertex pairs are weighted by the sum of their degrees. In this paper we first introduced four edge-grafting transformations to study the mathematical properties of the reciprocal degree distance of $$G$$ G . Using these nice mathematical properties, we characterize the extremal graphs among $$n$$ n vertex trees with given graphic parameters, such as pendants, matching number, domination number, diameter, vertex bipartition, et al. Some sharp upper bounds on the reciprocal degree distance of trees are determined.

Keywords: Reciprocal degree distance; Pendants; Diameter; Matching number; Domination number; Bipartition; 05C12 (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9649-1 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:30:y:2015:i:3:d:10.1007_s10878-013-9649-1

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

DOI: 10.1007/s10878-013-9649-1

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