A new technique to compute padmakar-ivan index and szeged index of pericondensed benzenoid graphs

Thalaya Al-Fozan; Paul Manuel; Indra Rajasingh; R. Sundara Rajan

doi:10.1166/jctn.2014.3390

A new technique to compute padmakar-ivan index and szeged index of pericondensed benzenoid graphs

Thalaya Al-Fozan, Paul Manuel, Indra Rajasingh, R. Sundara Rajan

Kuwait University

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

Distance properties of molecular graphs form an important topic in chemical graph theory. The Padmakar-Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from u and v and the Szeged (Sz) 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 we evolve an efficient method to calculate the PI index and Szeged index of pericondensed benzenoid graphs (r l), r l = 1 without using distance matrix. We also provide an Or l-linear time algorithm to compute the same.

Original language	English
Pages (from-to)	533-539
Number of pages	7
Journal	Journal of Computational and Theoretical Nanoscience
Volume	11
Issue number	2
DOIs	https://doi.org/10.1166/jctn.2014.3390
State	Published - Feb 2014

Keywords

PI Index
Pericondenced Benzenoid Graphs
Szeged Index

Funding Agency

Kuwait Foundation for the Advancement of Sciences

Access to Document

10.1166/jctn.2014.3390

Cite this

@article{32ff7d70d65844dcb21b15d5b1c8d942,

title = "A new technique to compute padmakar-ivan index and szeged index of pericondensed benzenoid graphs",

abstract = "Distance properties of molecular graphs form an important topic in chemical graph theory. The Padmakar-Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from u and v and the Szeged (Sz) 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 we evolve an efficient method to calculate the PI index and Szeged index of pericondensed benzenoid graphs (r l), r l = 1 without using distance matrix. We also provide an Or l-linear time algorithm to compute the same.",

keywords = "PI Index, Pericondenced Benzenoid Graphs, Szeged Index",

author = "Thalaya Al-Fozan and Paul Manuel and Indra Rajasingh and Rajan, \{R. Sundara\}",

year = "2014",

month = feb,

doi = "10.1166/jctn.2014.3390",

language = "English",

volume = "11",

pages = "533--539",

journal = "Journal of Computational and Theoretical Nanoscience",

issn = "1546-1955",

publisher = "American Scientific Publishers",

number = "2",

}

TY - JOUR

T1 - A new technique to compute padmakar-ivan index and szeged index of pericondensed benzenoid graphs

AU - Al-Fozan, Thalaya

AU - Manuel, Paul

AU - Rajasingh, Indra

AU - Rajan, R. Sundara

PY - 2014/2

Y1 - 2014/2

N2 - Distance properties of molecular graphs form an important topic in chemical graph theory. The Padmakar-Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from u and v and the Szeged (Sz) 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 we evolve an efficient method to calculate the PI index and Szeged index of pericondensed benzenoid graphs (r l), r l = 1 without using distance matrix. We also provide an Or l-linear time algorithm to compute the same.

AB - Distance properties of molecular graphs form an important topic in chemical graph theory. The Padmakar-Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from u and v and the Szeged (Sz) 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 we evolve an efficient method to calculate the PI index and Szeged index of pericondensed benzenoid graphs (r l), r l = 1 without using distance matrix. We also provide an Or l-linear time algorithm to compute the same.

KW - PI Index

KW - Pericondenced Benzenoid Graphs

KW - Szeged Index

UR - https://www.scopus.com/pages/publications/84892417599

U2 - 10.1166/jctn.2014.3390

DO - 10.1166/jctn.2014.3390

M3 - Article

AN - SCOPUS:84892417599

SN - 1546-1955

VL - 11

SP - 533

EP - 539

JO - Journal of Computational and Theoretical Nanoscience

JF - Journal of Computational and Theoretical Nanoscience

IS - 2

ER -

A new technique to compute padmakar-ivan index and szeged index of pericondensed benzenoid graphs

Abstract

Keywords

Funding Agency

Access to Document

Other files and links

Fingerprint

Cite this