z-logo
open-access-imgOpen Access
Exact Wiener Index of the Direct Product of a Path and a Wheel Graph
Author(s) -
Shi-Jie Duan,
Feng Li
Publication year - 2022
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2022/1077549
Subject(s) - wiener index , combinatorics , mathematics , graph product , graph , path (computing) , discrete mathematics , block graph , pathwidth , line graph , computer science , programming language
The direct product is one of the most important methods to construct large-scale graphs using existing small-scale graphs, and the topological structure parameters of the constructed large-scale graphs can be derived from small-scale graphs. For a simple undirected graph G , its Wiener index W G is defined as the sum of the distances between all different unordered pairs of vertices in the graph. Path is one of the most common and useful graphs, and it is found in almost all virtual and real networks; wheel graph is a kind of graph with good properties and convenient construction. In this paper, the exact value of the Wiener index of the direct product of a path and a wheel graph is given, and the obtained Wiener index is only derived from the orders of the two factor graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom