Fa   |   Ar   |   En
   Steiner Wiener Index of Complete M−Ary Trees  
نویسنده Legese Mesfin Masre
منبع Iranian Journal Of Mathematical Chemistry - 2021 - دوره : 12 - شماره : 2 - صفحه:101 -109
چکیده    Let g be a connected graph with vertex set v(g) and edge set e(g) for a subset s of v(g) the steiner distance d(s) of s is the minimum size of a connected subgraph whose vertex set contains s. for an integer k with 2 ≤k ≤n − 1, the k-th steiner wiener index of a graph g is defined as swk (g) = ∑s⊆v(g) d(s) |s|=k in this paper, we present exact values of the k -th steiner wiener index of complete m-ary trees by using inclusion-exclusion principle for various values of k.
کلیدواژه Steiner Distance ,Wiener Index ,Steiner Wiener Index ,Binary Trees ,Complete M-Ary Trees
آدرس Woldia University, Department Of Mathematics, Ethiopia
پست الکترونیکی mesfinmas@wldu.edu.et

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved