Name
Abstract | ||
|---|---|---|
The kth power of a graph G, denoted by G(k), is a graph whose vertex set is V (G), two distinct vertices being adjacent in Gk if and only if their distance in G is at most k. The hyper-Wiener index WW(G) of a graph G is defined as WW(G) = (1/2) Sigma({u, v}subset of V (G))(d(G)(u, v) + d(G)(2) (u, v)), where d(G)(u, v) is the distance between vertices u and v in G. In this paper, the bounds on the hyper-Wiener index of the graph G(k) are given. The Nordhaus-Gaddum-type inequality for the hyper-Wiener-index of the graph G(k) is also presented. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1142/S1793830911000973 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Hyper-Wiener index, Wiener index, complement | Discrete mathematics,Combinatorics,Edge-transitive graph,Vertex-transitive graph,Bound graph,Graph power,Cycle graph,Neighbourhood (graph theory),Distance-regular graph,Voltage graph,Mathematics | Journal |
Volume | Issue | ISSN |
3 | 1 | 1793-8309 |
Citations | PageRank | References |
1 | 0.38 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weijuan Zhang | 1 | 69 | 5.71 |
| Baoyindureng Wu | 2 | 99 | 24.68 |
| Xinhui An | 3 | 18 | 5.55 |