Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/9498
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.rights.license | openAccess | - |
dc.contributor.author | Su G. | - |
dc.contributor.author | Xiong L. | - |
dc.contributor.author | Gutman, Ivan | - |
dc.date.accessioned | 2020-09-19T18:26:17Z | - |
dc.date.available | 2020-09-19T18:26:17Z | - |
dc.date.issued | 2013 | - |
dc.identifier.issn | 1452-8630 | - |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/9498 | - |
dc.description.abstract | The k-th power of a graph G, denoted by Gk, is a graph with the same set of vertices as G, such that two vertices are adjacent in Gk if and only if their distance in G is at most k. The Harary index H is the sum of the reciprocal distances of all pairs of vertices of the underlying graph. Lower and upper bounds on H(Gk) are obtained. A Nordhaus-Gaddum type inequality for H(Gk) is also established. | - |
dc.rights | info:eu-repo/semantics/openAccess | - |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | - |
dc.source | Applicable Analysis and Discrete Mathematics | - |
dc.title | Harary index of the K-th power of a graph | - |
dc.type | article | - |
dc.identifier.doi | 10.2298/AADM121130024S | - |
dc.identifier.scopus | 2-s2.0-84874989751 | - |
Appears in Collections: | Faculty of Science, Kragujevac |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
10.2298-AADM121130024S.pdf | 279.85 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License