Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/17404
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Borovićanin, Bojana | - |
dc.contributor.author | das, kinkar | - |
dc.contributor.author | Furtula, Boris | - |
dc.contributor.author | Gutman, Ivan | - |
dc.date.accessioned | 2023-03-21T11:55:18Z | - |
dc.date.available | 2023-03-21T11:55:18Z | - |
dc.date.issued | 2017 | - |
dc.identifier.issn | 0340-6253 | en_US |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/17404 | - |
dc.description.abstract | Let \(G\) be a graph with vertex set \(V(G)\) and edge set \(E(G)\). Let \(d_i\) be the degree of the vertex \(v_i \in V(G)\). The first and second Zagreb indices, \(M_1 = \sum_{v_i \in V(G)} d_i^2\) and \(M_2 = \sum_{v_iv_j \in E(G)} d_i\,d_j\) are the oldest and most thoroughly investigated vertex degree-based molecular structure descriptors. An unusually large number of lower and upper bounds for \(M_1\) and \(M_2\) have been established. We provide a survey of the most significant estimates of this kind, attempting to cover the existing literature up to the end of year 2016. | en_US |
dc.language.iso | en_US | en_US |
dc.rights | info:eu-repo/semantics/openAccess | - |
dc.source | MATCH Communications in Mathematical and in Computer Chemistry | - |
dc.subject | degree of a vertex | en_US |
dc.subject | bounds | en_US |
dc.subject | first Zagreb index | en_US |
dc.subject | second Zagreb index | en_US |
dc.title | Bounds for Zagreb indices | en_US |
dc.type | review | 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 | |
---|---|---|---|---|
paper0121.pdf | 936.19 kB | Adobe PDF | View/Open |
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.