Computing the szeged, revised szeged and normalized revised szeged indices of the polycyclic aromatic hydrocarbons PAHk

Yan Li, Li Yingfang, Mohammad Reza Farahani, Muhammad Imran, M. R.Rajesh Kanna

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

The aim in this paper is to computing the Szeged Index (the vertex version) and its two new versions (the revised Szeged index and the normalized revised Szeged index) of the Polycyclic Aromatic Hydrocarbons PAHk. Let G be a connected graph. The vertex-set and edge-set of G denoted by V (G) and E(G) respectively. The distance between the vertices u and v, d(u, v), in a graph is the number of edges in a shortest path connecting them. The Szeged index of the graph G is defined as Sz(G) = e ∈ E(G)[nu(e , G) × nv (e, G)], where nu(e , G) = {x , x ∈ V(G), d(u,x) < d(x,v)}and nv(e , G)= {x , x ∈ V(G), d(v,x) < d( x,u)}.

Original languageEnglish
Pages (from-to)8874-8878
Number of pages5
JournalJournal of Computational and Theoretical Nanoscience
Volume13
Issue number11
DOIs
Publication statusPublished - 2016

Keywords

  • Normalized revised szeged index
  • Polycyclic aromatic hydrocarbons PAHk
  • Revised szeged index
  • Szeged index
  • Wiener index

ASJC Scopus subject areas

  • Chemistry(all)
  • Materials Science(all)
  • Condensed Matter Physics
  • Computational Mathematics
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Computing the szeged, revised szeged and normalized revised szeged indices of the polycyclic aromatic hydrocarbons PAHk'. Together they form a unique fingerprint.

Cite this