2018Iranian journal of mathemathical chemistry./Iranian journal of mathemathical chemistryRequires access

A Note on Revised Szeged Index of Graph Operations

Nasrin Dehgardi

Open publisher page 5 citations

Abstract

Let $G$ be a finite and simple graph with edge set $E(G)$‎. ‎The revised Szeged index is defined as‎ ‎$Sz^{*}(G)=sum_{e=uvin E(G)}(n_u(e|G)+frac{n_{G}(e)}{2})(n_v(e|G)+frac{n_{G}(e)}{2}),$‎ ‎where $n_u(e|G)$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$ and‎ ‎$n_{G}(e)$ is the number of‎ ‎equidistant vertices of $e$ in $G$‎. ‎In this paper‎, ‎we compute the revised Szeged index of the‎ ‎join and corona product of graphs‎.

About this research paper

What this paper is about

Let $G$ be a finite and simple graph with edge set $E(G)$‎. ‎The revised Szeged index is defined as‎ ‎$Sz^{*}(G)=sum_{e=uvin E(G)}(n_u(e|G)+frac{n_{G}(e)}{2})(n_v(e|G)+frac{n_{G}(e)}{2}),$‎ ‎where $n_u(e|G)$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$ and‎ ‎$n_{G}(e)$ is the number of‎ ‎equidistant vertices of $e$ in $G$‎. ‎In this paper‎, ‎we compute the revised Szeged index of the‎ ‎join and corona product of graphs‎.

Why it matters

OpenAlex reports 5 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

Let $G$ be a finite and simple graph with edge set $E(G)$‎. ‎The revised Szeged index is defined as‎ ‎$Sz^{*}(G)=sum_{e=uvin E(G)}(n_u(e|G)+frac{n_{G}(e)}{2})(n_v(e|G)+frac{n_{G}(e)}{2}),$‎ ‎where $n_u(e|G)$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$ and‎ ‎$n_{G}(e)$ is the number of‎ ‎equidistant vertices of $e$ in $G$‎. ‎In this paper‎, ‎we compute the revised Szeged index of the‎ ‎join and corona product of graphs‎.

Key concepts: Combinatorics, Equidistant, Mathematics, Graph, Product (mathematics), Join (topology), Simple graph, Discrete mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
A Note on Revised Szeged Index of Graph Operations — Research Paper | ScholarLens