Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Terminal Wiener Index of Detour saturated Trees and Nanostar Dendrimers

J. Baskar Babujee1, J. Senbagamalar1
1Department of Mathematics Anna University, Chennai – 600 025, India.
  • Published: 28/02/2015

Abstract

The Terminal Wiener index \( TW(G) \) of a graph \( G \) is defined as the sum of the distances between all pairs of pendant vertices. In this paper, we derive an explicit formula for calculating the Terminal Wiener index for Detour-saturated trees and Nanostar Dendrimers.

Keywords: Graph, distance, degree, vertices, dendrimer, detour saturated trees.
Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
J. Baskar Babujee, J. Senbagamalar. Terminal Wiener Index of Detour saturated Trees and Nanostar Dendrimers[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 092. 243-253. DOI: .