Please use this identifier to cite or link to this item:
Title: Harary index of the K-th power of a graph
Authors: Su G.
Xiong L.
Gutman, Ivan
Journal: Applicable Analysis and Discrete Mathematics
Issue Date: 1-Apr-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.
Type: journal article
DOI: 10.2298/AADM121130024S
ISSN: 14528630
SCOPUS: 84874989751
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)




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

Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.