General Transmission Lemma and Wiener complexity of triangular grids

作者:

Highlights:

摘要

The Transmission Lemma from Rajasingh et al. (2016) is extended to the General Transmission Lemma. It gives a formula for the transmission of a vertex u as a function of a collection of edge cuts and a u-routing that uniformly intersects the edge cuts. The applicability of the General Transmission Lemma is demonstrated by computing the Wiener complexity of triangular grid networks.

论文关键词:Graph distance,Transmission of vertex,Routing,Wiener index,Wiener complexity,Triangular grid network

论文评审过程:Received 5 January 2018, Revised 25 May 2018, Accepted 27 May 2018, Available online 26 June 2018, Version of Record 26 June 2018.

论文官网地址:https://doi.org/10.1016/j.amc.2018.05.056