Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/17405
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Milovanović, Igor Z. | - |
dc.contributor.author | Milovanović, Emina | - |
dc.contributor.author | Gutman, Ivan | - |
dc.contributor.author | Furtula, Boris | - |
dc.date.accessioned | 2023-03-21T11:59:31Z | - |
dc.date.available | 2023-03-21T11:59:31Z | - |
dc.date.issued | 2017 | - |
dc.identifier.issn | 2456-7884 | en_US |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/17405 | - |
dc.description.abstract | Let \(G= (V,E)\) be a simple connected graph with vertex set \(V=\{1,2,\ldots,n\}\) and edge set \(E=\{e_1, e_2,\ldots,e_m\}\). Let \(d_i\) be the degree of its vertex \(i\) and \(d(e_i)\) the degree of its edge \(e_i\). We consider the recently introduced degree–based graph invariants: the forgotten index \(F = \sum_{i\in V} d_i^3\), the hyper-Zagreb index \(HM = \sum_{i\sim j} (d_i + d_j)^2\), and the reformulated first Zagreb index \(EM_1 = \sum_{e_i\in E} d(e_i)^2\). A number of lower and upper bounds for \(F\), \(HM\), and \(EM_1\) are established, and the equality cases determined. | en_US |
dc.language.iso | en_US | en_US |
dc.rights | info:eu-repo/semantics/openAccess | - |
dc.source | International Journal of Applied Graph Theory | - |
dc.subject | degree (of vertex) | en_US |
dc.subject | degree (of edge) | en_US |
dc.subject | Zagreb index | en_US |
dc.subject | Forgotten index | en_US |
dc.subject | Hyper-Zagreb index | en_US |
dc.subject | Reformulated Zagreb index | en_US |
dc.title | Some inequalities for the forgotten topological index | en_US |
dc.type | article | en_US |
dc.description.version | Published | en_US |
dc.type.version | PublishedVersion | en_US |
Appears in Collections: | Faculty of Science, Kragujevac |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
paper0123.pdf | 1.02 MB | Adobe PDF | View/Open |
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.