An Analysis of the Sensitivity of Minimum Length (Wagner) Tree Topology to Changes in Data

1987 ◽  
Vol 36 (3) ◽  
pp. 227 ◽  
Author(s):  
Nancy A. Neff
Keyword(s):  
2018 ◽  
Vol 23 (1) ◽  
pp. 11-19
Author(s):  
Sławomir Bujnowski ◽  
Tomasz Marciniak ◽  
Beata Marciniak ◽  
Zbigniew Lutowski ◽  
Adam Marchewka

Abstract The aim of the paper is to draw attention to the possibility of improving the transmission properties of telecommunication networks by subordinating the capacity of individual links to the frequency of their occurrence in a set of minimum length paths. The defined unevenness coefficient was used to divide the global transmission resources of the network in order to make the traffic carried by this network as large as possible. The article presents the results of the simulation tests to which tree topology network was subjected.


2020 ◽  
Vol 9 (11) ◽  
pp. 9329-9333
Author(s):  
K. Deepika ◽  
K. Suriya ◽  
S. Meenakshi
Keyword(s):  

The minimum length in a graph G between two vertices is defined to be the distance between the two vertices and is denoted by d$\left(a,b\right)$. The farthest vertex distance from a vertex 'a' is known as the eccentricity e(a) of the vertex 'a'. Enumerating the vertex eccentricities in an increasing order is defined as the eccentricity sequence or eccentric sequence of the graph G [11]. The eccentric sequence of some graphs is computed in this paper.


2021 ◽  
pp. 1-1
Author(s):  
Tianjiao Wang ◽  
Xinyu Wang ◽  
Zengfu Wang ◽  
Chao Guo ◽  
William Moran ◽  
...  

2011 ◽  
Vol 68 (1-3) ◽  
pp. 407-425 ◽  
Author(s):  
Tatsuya Maruta ◽  
Yusuke Oya

Sign in / Sign up

Export Citation Format

Share Document