期刊
APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS
卷 7, 期 1, 页码 94-105出版社
UNIV BELGRADE, FAC ELECTRICAL ENGINEERING
DOI: 10.2298/AADM121130024S
关键词
Harary index; k-th power of graph; Nodrhaus-Gaddum type inequality
资金
- National Natural Science Foundation
- Serbian Ministry of Science and Education [174033]
The k-th power of a graph G, denoted by G(k), is a graph with the same set of vertices as G, such that two vertices are adjacent in G(k) 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(G(k)) are obtained. A Nordhaus Gaddum type inequality for H(G(k)) is also established.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据