Skip to main navigation Skip to search Skip to main content

General Transmission Lemma and Wiener complexity of triangular grids

  • Sandi Klavžar
  • , D. Azubha Jemilet
  • , Indra Rajasingh*
  • , Paul Manuel
  • , N. Parthiban
  • *Corresponding author for this work
  • Faculty of Mathematics and Physics
  • University of Ljubljana
  • Faculty of Natural Sciences and Mathematics
  • University of Maribor
  • Physics and Mechanics
  • Institute of Mathematics, Physics and Mechanics Ljubljana
  • Vellore Institute of Technology
  • Department of Computer Science and Engineering
  • SRM Institute of Science and Technology

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

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 languageEnglish
Pages (from-to)115-122
Number of pages8
JournalApplied Mathematics and Computation
Volume338
DOIs
StatePublished - 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