2012Discussiones Mathematicae Graph TheoryRequires access

Wiener and vertex PI indices of the strong product of graphs

K. Pattabiraman, P. Paulraja

Open publisher page 33 citations

Abstract

The Wiener index of a connected graph G, denoted by W(G), is defined as 1 P u,v∈V (G) dG(u,v). Similarly, the hyper-Wiener index of a connected graph G, denoted by WW(G), is defined as 1 W(G) + 1 P u,v∈V (G) d 2 (u,v). The vertex Padmakar-Ivan (vertex PI) index of a graph G is the sum over all edges uv of G of the number of vertices which are not equidistant from u and v. In this paper, the exact formulae for Wiener, hyperWiener and vertex PI indices of the strong product G ⊠ Km0,m1,...,mr−1 , where Km0,m1,...,mr−1 is the complete multipartite graph with partite sets of sizes m0,m1,...,mr−1, are obtained. Also lower bounds for Wiener and hyper-Wiener indices of strong product of graphs are established.

About this research paper

What this paper is about

The Wiener index of a connected graph G, denoted by W(G), is defined as 1 P u,v∈V (G) dG(u,v). Similarly, the hyper-Wiener index of a connected graph G, denoted by WW(G), is defined as 1 W(G) + 1 P u,v∈V (G) d 2 (u,v). The vertex Padmakar-Ivan (vertex PI) index of a graph G is the sum over all edges uv of G of the number of vertices which are not equidistant from u and v. In this paper, the exact formulae for Wiener, hyperWiener and vertex PI indices of the strong product G ⊠ Km0,m1,...,mr−1 , where Km0,m1,...,mr−1 is the complete multipartite graph with partite sets of sizes m0,m1,...,mr−1, are obtained. Also lower bounds for Wiener and hyper-Wiener indices of strong product of graphs are established.

Why it matters

OpenAlex reports 33 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The Wiener index of a connected graph G, denoted by W(G), is defined as 1 P u,v∈V (G) dG(u,v). Similarly, the hyper-Wiener index of a connected graph G, denoted by WW(G), is defined as 1 W(G) + 1 P u,v∈V (G) d 2 (u,v). The vertex Padmakar-Ivan (vertex PI) index of a graph G is the sum over all edges uv of G of the number of vertices which are not equidistant from u and v. In this paper, the exact formulae for Wiener, hyperWiener and vertex PI indices of the strong product G ⊠ Km0,m1,...,mr−1 , where Km0,m1,...,mr−1 is the complete multipartite graph with partite sets of sizes m0,m1,...,mr−1, are obtained. Also lower bounds for Wiener and hyper-Wiener indices of strong product of graphs are established.

Key concepts: Mathematics, Combinatorics, Wiener index, Vertex (graph theory), Product (mathematics), Pi, Discrete mathematics, Graph

Related papers

Back to paper searchBrowse research topicsOriginal source
Wiener and vertex PI indices of the strong product of graphs — Research Paper | ScholarLens