Bound for vertex PI index in terms of simple graph parameters

Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/9429

Full metadata record

DC Field	Value	Language
dc.rights.license	BY-NC-ND	-
dc.contributor.author	das, kinkar	-
dc.contributor.author	Gutman, Ivan	-
dc.date.accessioned	2020-09-19T18:16:19Z	-
dc.date.available	2020-09-19T18:16:19Z	-
dc.date.issued	2013	-
dc.identifier.issn	0354-5180	-
dc.identifier.uri	https://scidar.kg.ac.rs/handle/123456789/9429	-
dc.description.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.	-
dc.rights	openAccess	-
dc.rights.uri	https://creativecommons.org/licenses/by-nc-nd/4.0/	-
dc.source	Filomat	-
dc.title	Bound for vertex PI index in terms of simple graph parameters	-
dc.type	article	-
dc.identifier.doi	10.2298/FIL1308583D	-
dc.identifier.scopus	2-s2.0-84888402283	-
Appears in Collections:	Faculty of Science, Kragujevac

127

11

Files in This Item:

File	Description	Size	Format
10.2298-FIL1308583D.pdf		52.18 kB	Adobe PDF	View/Open

This item is licensed under a Creative Commons License

SCIDAR - A Digital Archive of the University of Kragujevac