Bound for vertex PI index in terms of simple graph parameters

Ch Kinkar; Ivan Gutman

doi:10.2298/FIL1308583D

Bound for vertex PI index in terms of simple graph parameters

Ch Kinkar
, Ivan Gutman

Department of Mathematics

University of Kragujevac

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

10 Scopus citations

Abstract

The vertex PI index is a distance-based molecular structure descriptor, that recently found numerous chemical applications. In this letter we obtain a lower bound on the vertex PI index of a connected graph in terms of number of vertices, edges, pendent vertices, and clique number, and characterize the extremal graphs.

Original language	English
Pages (from-to)	1583-1587
Number of pages	5
Journal	Filomat
Volume	27
Issue number	8
DOIs	https://doi.org/10.2298/FIL1308583D
State	Published - 2013

Keywords

Clique number
Graph
Lower bound
Vertex PI index

Access to Document

10.2298/FIL1308583D

Cite this

@article{6b990fec0fa84c949076bd2473c2918d,

title = "Bound for vertex PI index in terms of simple graph parameters",

abstract = "The vertex PI index is a distance-based molecular structure descriptor, that recently found numerous chemical applications. In this letter we obtain a lower bound on the vertex PI index of a connected graph in terms of number of vertices, edges, pendent vertices, and clique number, and characterize the extremal graphs.",

keywords = "Clique number, Graph, Lower bound, Vertex PI index",

author = "Ch Kinkar and Ivan Gutman",

year = "2013",

doi = "10.2298/FIL1308583D",

language = "English",

volume = "27",

pages = "1583--1587",

journal = "Filomat",

issn = "0354-5180",

publisher = "University of Nis",

number = "8",

}

TY - JOUR

T1 - Bound for vertex PI index in terms of simple graph parameters

AU - Kinkar, Ch

AU - Gutman, Ivan

PY - 2013

Y1 - 2013

N2 - The vertex PI index is a distance-based molecular structure descriptor, that recently found numerous chemical applications. In this letter we obtain a lower bound on the vertex PI index of a connected graph in terms of number of vertices, edges, pendent vertices, and clique number, and characterize the extremal graphs.

AB - The vertex PI index is a distance-based molecular structure descriptor, that recently found numerous chemical applications. In this letter we obtain a lower bound on the vertex PI index of a connected graph in terms of number of vertices, edges, pendent vertices, and clique number, and characterize the extremal graphs.

KW - Clique number

KW - Graph

KW - Lower bound

KW - Vertex PI index

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

U2 - 10.2298/FIL1308583D

DO - 10.2298/FIL1308583D

M3 - Article

AN - SCOPUS:84888402283

SN - 0354-5180

VL - 27

SP - 1583

EP - 1587

JO - Filomat

JF - Filomat

IS - 8

ER -

Bound for vertex PI index in terms of simple graph parameters

Abstract

Keywords

Access to Document

Other files and links

Cite this