Some results on the reciprocal sum-degree distance of graphs

Guifu Su (), Liming Xiong (), Xiaofeng Su () and Xianglian Chen ()
Additional contact information
Guifu Su: School of Mathematics, Beijing Institute of Technology
Liming Xiong: School of Mathematics, Beijing Institute of Technology
Xiaofeng Su: College of Arts and Science, Shanghai Maritime University
Xianglian Chen: Changji University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 3, No 3, 435-446

Abstract: Abstract In this contribution, we first investigate sharp bounds for the reciprocal sum-degree distance of graphs with a given matching number. The corresponding extremal graphs are characterized completely. Then we explore the $$k$$ k -decomposition for the reciprocal sum-degree distance. Finally, we establish formulas for the reciprocal sum-degree distance of join and the Cartesian product of graphs.

Keywords: The reciprocal sum-degree distance; Harary index; Matching number; $$k$$ k -Decomposition; Join graphs; Cartesian product graphs (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9645-5 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-9645-5

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

DOI: 10.1007/s10878-013-9645-5

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