A. R. Ashrafi and B. Manoochehrian (2006) On the PI polynomial of a graph

getCITED

Home Search Add Content Reports Help

Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations

Add to Bookstack | Show Bookstack | Change Bookstack

On the PI polynomial of a graph

Post a Comment

CONTRIBUTORS:

	Author:	A. R. Ashrafi
	Author:	B. Manoochehrian

JOURNAL:

Utilitas mathematica, 71(1), 97 - 108.

YEAR:

2006

PUB TYPE:

Journal Article

SUBJECT(S):

chemistry - mathematical

DISCIPLINE:

Mathematics

HTTP:

http://lori.academicdirect.org/cites/48.pdf

LANGUAGE:

English

PUB ID:

103-436-118 (Last edited on 2007/07/09 08:09:29 GMT-6)

SPONSOR(S):

ABSTRACT:
The Padmakar-Ivan (PI) index of a graph G is defined as PI(G) = [n eu(e|G) + nev(e|G)], where neu(e|G) is the number of edges of G lying closer to u than to v, nev(e|G) is the number of edges of G lying closer to v than to u and summation goes over all edges of G. In this paper, we define the PI polynomial of a graph and investigate some of the elementary properties of this polynomial and compute it for some well-known graphs. Finally, we generalize some of the properties of Wiener polynomial to PI polynomial.

STATISTICS

Click on # to view
Citations		0
References		1
Comments		0
Quality		0/0.00
Interest		0/0.00
View(er)s		1/167

Quality
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Interest
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Prev | Next