Counting relations for general zagreb indices

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

Full metadata record

DC Field	Value	Language
dc.rights.license	BY-NC-ND	-
dc.contributor.author	Britto Antony Xavier G.	-
dc.contributor.author	Suresh E.	-
dc.contributor.author	Gutman, Ivan	-
dc.date.accessioned	2021-04-20T20:47:44Z	-
dc.date.available	2021-04-20T20:47:44Z	-
dc.date.issued	2014	-
dc.identifier.issn	1450-9628	-
dc.identifier.uri	https://scidar.kg.ac.rs/handle/123456789/12422	-
dc.description.abstract	The first and second general Zagreb indices of a graph G, with vertex set V and edge set E, are defined asMk1 = ∑v∈V d(u)k and Mk2 = ∑uv∈E[d(u) d(v)]k, where d(v) is the degree of the vertex v of G. We present combinatorial identities, relating Mk1 and Mk2 with counts of various subgraphs contained in the graph G.	-
dc.rights	openAccess	-
dc.rights.uri	https://creativecommons.org/licenses/by-nc-nd/4.0/	-
dc.source	Kragujevac Journal of Mathematics	-
dc.title	Counting relations for general zagreb indices	-
dc.type	article	-
dc.identifier.doi	10.5937/kgjmath1401095x	-
dc.identifier.scopus	2-s2.0-84903690479	-
Appears in Collections:	Faculty of Science, Kragujevac

122

6

Files in This Item:

File	Description	Size	Format
10.5937-kgjmath1401095x.pdf		303.3 kB	Adobe PDF	View/Open

This item is licensed under a Creative Commons License

SCIDAR - A Digital Archive of the University of Kragujevac