Some results on the reciprocal sum-degree distance of graphs

Guifu Su; Liming Xiong; Xiaofeng Su; Xianglian Chen

doi:10.1007/s10878-013-9645-5

Some results on the reciprocal sum-degree distance of graphs

Guifu Su^*
, Liming Xiong
, Xiaofeng Su
, Xianglian Chen

^*Corresponding author for this work

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

22 Citations (Scopus)

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

Original language	English
Pages (from-to)	435-446
Number of pages	12
Journal	Journal of Combinatorial Optimization
Volume	30
Issue number	3
DOIs	https://doi.org/10.1007/s10878-013-9645-5
Publication status	Published - 1 Oct 2015

Keywords

Cartesian product graphs
Harary index
Join graphs
Matching number
The reciprocal sum-degree distance
k-Decomposition

Access to Document

10.1007/s10878-013-9645-5

Cite this

@article{b026f3ee4d4e4984941cbfe5eeed3110,

title = "Some results on the reciprocal sum-degree distance of graphs",

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 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 = "Cartesian product graphs, Harary index, Join graphs, Matching number, The reciprocal sum-degree distance, k-Decomposition",

author = "Guifu Su and Liming Xiong and Xiaofeng Su and Xianglian Chen",

note = "Publisher Copyright: {\textcopyright} 2013, The Author(s).",

year = "2015",

month = oct,

day = "1",

doi = "10.1007/s10878-013-9645-5",

language = "English",

volume = "30",

pages = "435--446",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Some results on the reciprocal sum-degree distance of graphs

AU - Su, Guifu

AU - Xiong, Liming

AU - Su, Xiaofeng

AU - Chen, Xianglian

PY - 2015/10/1

Y1 - 2015/10/1

N2 - 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 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.

AB - 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 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.

KW - Cartesian product graphs

KW - Harary index

KW - Join graphs

KW - Matching number

KW - The reciprocal sum-degree distance

KW - k-Decomposition

UR - https://www.scopus.com/pages/publications/84940722508

U2 - 10.1007/s10878-013-9645-5

DO - 10.1007/s10878-013-9645-5

M3 - Article

AN - SCOPUS:84940722508

SN - 1382-6905

VL - 30

SP - 435

EP - 446

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 3

ER -

Some results on the reciprocal sum-degree distance of graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this