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.
| Original language | English |
|---|---|
| Pages (from-to) | 115-122 |
| Number of pages | 8 |
| Journal | Applied Mathematics and Computation |
| Volume | 338 |
| DOIs | |
| State | Published - 1 Dec 2018 |
Keywords
- Graph distance
- Routing
- Transmission of vertex
- Triangular grid network
- Wiener complexity
- Wiener index
Fingerprint
Dive into the research topics of 'General Transmission Lemma and Wiener complexity of triangular grids'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver