General Transmission Lemma and Wiener complexity of triangular grids

Sandi Klavžar, D. Azubha Jemilet, Indra Rajasingh, Paul Manuel and N. Parthiban

Applied Mathematics and Computation, 2018, vol. 338, issue C, 115-122

Abstract: 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.

Keywords: Graph distance; Transmission of vertex; Routing; Wiener index; Wiener complexity; Triangular grid network (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318304739
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:338:y:2018:i:c:p:115-122

DOI: 10.1016/j.amc.2018.05.056

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().