Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
type: Item
instance of: scholarly article
title: Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
zbMATH Open document ID: 1327.05092
author: Shuchao Li
author: Xian Meng
published in: Journal of Combinatorial Optimization
publication date: 2015-09-28T00:00:00Z
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6485824
zbMATH Keywords: reciprocal degree distance
zbMATH Keywords: pendants
zbMATH Keywords: diameter
zbMATH Keywords: matching number
zbMATH Keywords: domination number
zbMATH Keywords: bipartition
MaRDI profile type: Publication
full work available at URL: s10878-013-9649-1
OpenAlex ID: W2117701440
cites work: Additively weighted Harary index of some composite graphs
cites work: The eccentric connectivity index of nanotubes and nanotori
cites work: Walks and paths in trees
cites work: Q3097395
cites work: Wiener index of trees: Theory and applications
cites work: Q4368728
cites work: On the reciprocal degree distance of graphs
cites work: Trees with minimal Laplacian coefficients
cites work: Comparison of graphs by their number of spanning trees
cites work: Edge-grafting theorems on permanents of the Laplacian matrices of graphs and their applications
cites work: Trees with the seven smallest and eight greatest Harary indices
DOI: 10.1007/S10878-013-9649-1
description: scientific article; zbMATH DE number 6485824