Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/9498
Title: Harary index of the K-th power of a graph
Authors: Su G.
Xiong L.
Gutman, Ivan
Issue Date: 2013
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.
URI: https://scidar.kg.ac.rs/handle/123456789/9498
Type: article
DOI: 10.2298/AADM121130024S
ISSN: 1452-8630
SCOPUS: 2-s2.0-84874989751
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

454

Downloads(s)

15

Files in This Item:
File Description SizeFormat 
10.2298-AADM121130024S.pdf279.85 kBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons