SCIDAR - A Digital Archive of the University of Kragujevac
A digital archive of the University of Kragujevac contains easily searchable and up-to-date research results.
Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/15557Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.rights.license | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
| dc.contributor.author | Mao, Yaping | - |
| dc.contributor.author | Furtula, Boris | - |
| dc.date.accessioned | 2023-02-08T12:07:20Z | - |
| dc.date.available | 2023-02-08T12:07:20Z | - |
| dc.date.issued | 2021 | - |
| dc.identifier.issn | 0340-6253 | en_US |
| dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/15557 | - |
| dc.description.abstract | Steiner distance dG(S) is a natural generalization of the concept of distance in a graph. For a connected graph G of order at least 2 and S ⊆ V (G), dG(S) is equal to the minimum size among all connected subgraphs whose vertex sets are equal to the set S. Here, the known results on the Steiner distance parameters used in chemical graph theory such as Steiner Wiener index, Steiner degree distance, Steiner Harary index, Steiner Gutman index, Steiner hyper–Wiener index, and Steiner Hosoya polynomial are surveyed. Additionally, some conjectures and open problems are listed. | en_US |
| dc.description.sponsorship | Supported by the National Science Foundation of China (Nos. 11601254, 11551001, 11161037, 61763041, 11661068, and 11461054), the Science Fond of Qinghai Province (Nos. 2016-ZJ-948Q, and 2014-ZJ-907), the Qinghai Key Laboratory of Internet of Things Project (2017-ZJ-Y21) and the Serbian Ministry of Education, Science and Technological Development (Grant No. 451-03-9/2021-14/200122). | en_US |
| dc.description.uri | https://match.pmf.kg.ac.rs/electronic_versions/Match86/n2/match86n2_211-287.pdf | en_US |
| dc.language.iso | en_US | en_US |
| dc.publisher | University of Kragujevac | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | - |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
| dc.source | MATCH Communications in Mathematical and in Computer Chemistry | - |
| dc.title | Steiner distance in chemical graph theory | 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 | |
 | Page views(s)368 | Downloads(s)65 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| paper0158.pdf | 1.17 MB | Adobe PDF |  View/Open |
This item is licensed under a Creative Commons License
