On the Wiener Index of the Strong Product of Paths

Shijie Duan; Feng Li

On the Wiener Index of the Strong Product of Paths

Shijie Duan
, Feng Li

Qinghai Normal University

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

4 Scopus citations

Abstract

The sum of the distances between all unordered pairs of vertices of a connected graph G is called the Wiener index of G and denoted by W(G). In this paper, we researched the Wiener index of the strong product of a class of paths with given orders. By using the structural characteristics of the strong product graph, we derive the exact Wiener index of the strong product of two paths while their lengths have different parities.

Original language	English
Article number	IJCS_49_2_14
Journal	IAENG International Journal of Computer Science
Volume	49
Issue number	2
State	Published - 2022
Externally published	Yes

Keywords

Edge-forwarding index
Path
Strong product graph
Topological structure
Wiener index

Cite this

@article{85c050703c044528b15ff7b51aa4e175,

title = "On the Wiener Index of the Strong Product of Paths",

abstract = "The sum of the distances between all unordered pairs of vertices of a connected graph G is called the Wiener index of G and denoted by W(G). In this paper, we researched the Wiener index of the strong product of a class of paths with given orders. By using the structural characteristics of the strong product graph, we derive the exact Wiener index of the strong product of two paths while their lengths have different parities.",

keywords = "Edge-forwarding index, Path, Strong product graph, Topological structure, Wiener index",

author = "Shijie Duan and Feng Li",

year = "2022",

language = "英语",

volume = "49",

journal = "IAENG International Journal of Computer Science",

issn = "1819-656X",

publisher = "International Association of Engineers",

number = "2",

}

TY - JOUR

T1 - On the Wiener Index of the Strong Product of Paths

AU - Duan, Shijie

AU - Li, Feng

PY - 2022

Y1 - 2022

N2 - The sum of the distances between all unordered pairs of vertices of a connected graph G is called the Wiener index of G and denoted by W(G). In this paper, we researched the Wiener index of the strong product of a class of paths with given orders. By using the structural characteristics of the strong product graph, we derive the exact Wiener index of the strong product of two paths while their lengths have different parities.

AB - The sum of the distances between all unordered pairs of vertices of a connected graph G is called the Wiener index of G and denoted by W(G). In this paper, we researched the Wiener index of the strong product of a class of paths with given orders. By using the structural characteristics of the strong product graph, we derive the exact Wiener index of the strong product of two paths while their lengths have different parities.

KW - Edge-forwarding index

KW - Path

KW - Strong product graph

KW - Topological structure

KW - Wiener index

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

M3 - 文章

AN - SCOPUS:85131067832

SN - 1819-656X

VL - 49

JO - IAENG International Journal of Computer Science

JF - IAENG International Journal of Computer Science

IS - 2

M1 - IJCS_49_2_14

ER -

On the Wiener Index of the Strong Product of Paths

Abstract

Keywords

Other files and links

Fingerprint

Cite this