原创力文档- 1、本文档共6页，可阅读全部内容。
- 2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
- 3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
- 5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
- 6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传，每下载1次， 网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Three Types of Topological Indices of the Join of k Graphs
LI Jing, WEI Fuyi**
(College of Science, South China Agricultural University, GuangZhou 510642)
5
10
15
Abstract: The join of two vertex disjoint graphs is obtained from their union by including all edges
between the vertices in one graph and the vertices in the other. This paper mainly focused on the
calculation formulas of Wiener indices, hyper-Wiener indices and reverse Wiener indices of the join of
k graphs based on two de?nitions.
Keywords: Graph theory; Wiener index; Hyper-Wiener index; Reverse Wiener index; The join of
graphs
0 Introduction
Throughout this paper we assume that graph G is a simple connected graph. The vertex
and edge sets of graph G are denoted by V (G) and E (G) . For every u, v?∈V (G) , the
distance dG (u, v) (or simply d (u, v) ) between the vertices u and v of G is equal to the
length of the shortest path that connects u and v . The diameter of graph G is the largest
distance between two vertices in G , denoted by d (G) . Let
? (G, k ) denote the number of
unordered vertex pairs of G , the distance of which is equal to k . In 1947, Wiener [1] ?rst put
forward the de?nition of Wiener index which is denoted by W (G) . It is de?ned as the sum of
20
distances between all unordered vertex pairs of graph G . By the de?nition of W (G) , it turns
out that
W (G)??
∑
{u ,v}?V (G )
d (u, v)???∑ k? (G, k ).
k?≥1
(1.1)
The hyper-Wiener index, denoted by WW (G) , is introduced by Randic and is de?ned as
1 1 1
2 2 {u ,v}?V (G ) 2
(1.2)
25
with the summation going through all pairs of vertices of G [2].
This paper also focuses on the reverse Wiener index of graph G which is de?ned as
?(G)??
n(n??1)d (G)
2
? W (G),
(1.3)
where n and d (G) are the number of vertices and the diameter of G respectively.
In the sequence, the notion of the join of two or more graphs is used frequently throughout
30
this paper. The join of two vertex disjoint
文档评论（0）