Two upper bounds for the degree distances of four sums of graphs

Mingqiang An; Liming Xiong; Kinkar Ch Das

doi:10.2298/FIL1403579A

Two upper bounds for the degree distances of four sums of graphs

Mingqiang An
, Liming Xiong
, Kinkar Ch Das

数学学院

科研成果: 期刊稿件 › 文章 › 同行评审

13 引用（Scopus）

摘要

The degree distance (DD), which is a weight version of theWiener index, defined for a connected graph G as vertex-degree-weighted sum of the distances, that is, DD(G) = S∑_{u,v}⊆V(G)[d_G(u) +d_G(v)]d(u,v|G), where d_G(u) denotes the degree of a vertex u in G and d(u,v|G) denotes the distance between two vertices u and v in G: In this paper, we establish two upper bounds for the degree distances of four sums of two graphs in terms of other indices of two individual graphs.

源语言	英语
页（从-至）	579-590
页数	12
期刊	Filomat
卷	28
期	3
DOI	https://doi.org/10.2298/FIL1403579A
出版状态	已出版 - 2014

访问文件

10.2298/FIL1403579A

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{283f4b4f5eab4c23bd206c6384986bb9,

title = "Two upper bounds for the degree distances of four sums of graphs",

abstract = "The degree distance (DD), which is a weight version of theWiener index, defined for a connected graph G as vertex-degree-weighted sum of the distances, that is, DD(G) = S∑\{u,v\}⊆V(G)[dG(u) +dG(v)]d(u,v|G), where dG(u) denotes the degree of a vertex u in G and d(u,v|G) denotes the distance between two vertices u and v in G: In this paper, we establish two upper bounds for the degree distances of four sums of two graphs in terms of other indices of two individual graphs.",

keywords = "Bounds, Degree distance, Distance (in graphs), Sums of graphs",

author = "Mingqiang An and Liming Xiong and Das, \{Kinkar Ch\}",

year = "2014",

doi = "10.2298/FIL1403579A",

language = "English",

volume = "28",

pages = "579--590",

journal = "Filomat",

issn = "0354-5180",

publisher = "University of Nis",

number = "3",

}

TY - JOUR

T1 - Two upper bounds for the degree distances of four sums of graphs

AU - An, Mingqiang

AU - Xiong, Liming

AU - Das, Kinkar Ch

PY - 2014

Y1 - 2014

N2 - The degree distance (DD), which is a weight version of theWiener index, defined for a connected graph G as vertex-degree-weighted sum of the distances, that is, DD(G) = S∑{u,v}⊆V(G)[dG(u) +dG(v)]d(u,v|G), where dG(u) denotes the degree of a vertex u in G and d(u,v|G) denotes the distance between two vertices u and v in G: In this paper, we establish two upper bounds for the degree distances of four sums of two graphs in terms of other indices of two individual graphs.

AB - The degree distance (DD), which is a weight version of theWiener index, defined for a connected graph G as vertex-degree-weighted sum of the distances, that is, DD(G) = S∑{u,v}⊆V(G)[dG(u) +dG(v)]d(u,v|G), where dG(u) denotes the degree of a vertex u in G and d(u,v|G) denotes the distance between two vertices u and v in G: In this paper, we establish two upper bounds for the degree distances of four sums of two graphs in terms of other indices of two individual graphs.

KW - Bounds

KW - Degree distance

KW - Distance (in graphs)

KW - Sums of graphs

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

U2 - 10.2298/FIL1403579A

DO - 10.2298/FIL1403579A

M3 - Article

AN - SCOPUS:84904387978

SN - 0354-5180

VL - 28

SP - 579

EP - 590

JO - Filomat

JF - Filomat

IS - 3

ER -

Two upper bounds for the degree distances of four sums of graphs

摘要

访问文件

其它文件与链接

指纹

引用此