Steiner Degree Distance of Two Graph Products

Yaping Mao; Zhao Wang; Kinkar Ch Das

doi:10.2478/auom-2019-0020

Steiner Degree Distance of Two Graph Products

Yaping Mao
, Zhao Wang
, Kinkar Ch Das

Department of Mathematics

Qinghai Normal University
Center for Mathematics and Interdisciplinary Sciences of Qinghai Province
Beijing Normal University

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

7 Scopus citations

Abstract

The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑V(G)|S|=k[∑vϵSdegG(v)]dG(S), where d_G(S) is the Steiner k-distance of S and deg_G(v) is the degree of the vertex v in G. In this paper, we investigate the Steiner degree distance of complete and Cartesian product graphs.

Original language	English
Pages (from-to)	83-99
Number of pages	17
Journal	Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica
Volume	27
Issue number	2
DOIs	https://doi.org/10.2478/auom-2019-0020
State	Published - 1 Jun 2019

Keywords

Cartesian product
Complete product
Degree distance
Steiner degree distance

Access to Document

10.2478/auom-2019-0020

Cite this

@article{ab68bcb722b3478da463afe1f5048a05,

title = "Steiner Degree Distance of Two Graph Products",

abstract = "The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑V(G)|S|=k[∑vϵSdegG(v)]dG(S), where dG(S) is the Steiner k-distance of S and degG(v) is the degree of the vertex v in G. In this paper, we investigate the Steiner degree distance of complete and Cartesian product graphs.",

keywords = "Cartesian product, Complete product, Degree distance, Steiner degree distance",

author = "Yaping Mao and Zhao Wang and Das, \{Kinkar Ch\}",

note = "Publisher Copyright: {\textcopyright} 2019 Yaping Mao et al., published by Sciendo 2019.",

year = "2019",

month = jun,

day = "1",

doi = "10.2478/auom-2019-0020",

language = "English",

volume = "27",

pages = "83--99",

journal = "Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica",

issn = "1224-1784",

publisher = "Paradigm Publishing Services",

number = "2",

}

TY - JOUR

T1 - Steiner Degree Distance of Two Graph Products

AU - Mao, Yaping

AU - Wang, Zhao

AU - Das, Kinkar Ch

PY - 2019/6/1

Y1 - 2019/6/1

N2 - The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑V(G)|S|=k[∑vϵSdegG(v)]dG(S), where dG(S) is the Steiner k-distance of S and degG(v) is the degree of the vertex v in G. In this paper, we investigate the Steiner degree distance of complete and Cartesian product graphs.

AB - The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑V(G)|S|=k[∑vϵSdegG(v)]dG(S), where dG(S) is the Steiner k-distance of S and degG(v) is the degree of the vertex v in G. In this paper, we investigate the Steiner degree distance of complete and Cartesian product graphs.

KW - Cartesian product

KW - Complete product

KW - Degree distance

KW - Steiner degree distance

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

U2 - 10.2478/auom-2019-0020

DO - 10.2478/auom-2019-0020

M3 - Article

AN - SCOPUS:85073879861

SN - 1224-1784

VL - 27

SP - 83

EP - 99

JO - Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica

JF - Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica

IS - 2

ER -

Steiner Degree Distance of Two Graph Products

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this