On the maximum ABC index of graphs without pendent vertices

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Shao, Zehui	-
dc.contributor.author	Wu P.	-
dc.contributor.author	Gao Y.	-
dc.contributor.author	Gutman, Ivan	-
dc.contributor.author	Zhang X.	-
dc.date.accessioned	2021-04-20T18:10:35Z	-
dc.date.available	2021-04-20T18:10:35Z	-
dc.date.issued	2017	-
dc.identifier.issn	0096-3003	-
dc.identifier.uri	https://scidar.kg.ac.rs/handle/123456789/11367	-
dc.description.abstract	© 2017 Elsevier Inc. Let G be a simple graph. The atom–bond connectivity index (ABC) of G is defined as ABC(G)=∑uv∈E(G)[Formula presented], where d(v) denotes the degree of vertex v of G. We characterize the graphs with n vertices, minimum vertex degree ≥ 2, and m edges for m=2n−4 and m=2n−3, that have maximum ABC index.	-
dc.rights	restrictedAccess	-
dc.source	Applied Mathematics and Computation	-
dc.title	On the maximum ABC index of graphs without pendent vertices	-
dc.type	article	-
dc.identifier.doi	10.1016/j.amc.2017.07.075	-
dc.identifier.scopus	2-s2.0-85044140180	-
Appears in Collections:	Faculty of Science, Kragujevac

111

5

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