On the reciprocal degree distance of graphs with cut vertices or edges

arXiv1503.03205MaRDI QIDQ6259846FDOQ6259846

Authors: Xiaoxin Li 

Publication date: 11 March 2015

Abstract: In this paper, the extremal graph with the maximum RRD-value among all the graphs of order n with given cut vertices or edges is characterized. In addition, an upper bounds on the reciprocal degree distance in terms of the number of cut edges is provided.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12)

This page was built for publication: On the reciprocal degree distance of graphs with cut vertices or edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6259846)