M. R. Darafsheh, Hassan Jolany, M. H. Khalifeh
Abstract
Let G be a molecular graph with vertex set V. The Wiener index of G which is denoted by W(G) is defined by where d(u, v) denotes the distance between the vertices u and v. In this paper we will find the Wiener index of a phenylenic pattern graph.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let G be a molecular graph with vertex set V. The Wiener index of G which is denoted by W(G) is defined by where d(u, v) denotes the distance between the vertices u and v. In this paper we will find the Wiener index of a phenylenic pattern graph.
Key concepts: Wiener index, Vertex (graph theory), Combinatorics, Graph, Index (typography), Mathematics, Topological index, Connectivity