First and second extremal bipartite graphs with respect to PI index

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

Full metadata record

DC Field	Value	Language
dc.rights.license	restrictedAccess	-
dc.contributor.author	Yarahmadi Z.	-
dc.contributor.author	Ashrafi, Ali Reza	-
dc.contributor.author	Gutman, Ivan	-
dc.date.accessioned	2021-04-20T14:32:27Z	-
dc.date.available	2021-04-20T14:32:27Z	-
dc.date.issued	2011	-
dc.identifier.issn	0895-7177	-
dc.identifier.uri	https://scidar.kg.ac.rs/handle/123456789/9973	-
dc.description.abstract	The Padmakar-Ivan (PI) index of a graph G is defined as the sum of terms [mu(e)+mv(e)] over all edges of G, where e is an edge, connecting the vertices u and v, where mu(e) is the number of edges of G lying closer to the vertex u than to the vertex v, and where mv(e) is defined analogously. The extremal values of the PI index are determined in the class of connected bipartite graphs with a given number of edges. © 2011 Elsevier Ltd.	-
dc.rights	info:eu-repo/semantics/restrictedAccess	-
dc.source	Mathematical and Computer Modelling	-
dc.title	First and second extremal bipartite graphs with respect to PI index	-
dc.type	article	-
dc.identifier.doi	10.1016/j.mcm.2011.06.001	-
dc.identifier.scopus	2-s2.0-80051583174	-
Appears in Collections:	Faculty of Science, Kragujevac

740

11

Files in This Item:

File	Description	Size	Format
PaperMissing.pdf Restricted Access		29.86 kB	Adobe PDF	View/Open

SCIDAR - A Digital Archive of the University of Kragujevac