Cost-allocation problems for fuzzy agents in a fixed-tree network

Cost-allocation problems in a fixed network are concerned with distributing the costs for use by a group of clients who cooperate in order to reduce such costs. We work only with tree networks and we assume that a minimum cost spanning tree network has already been constructed and now we are interested in the maintenance costs. The classic problem supposes that each agent stays for the entire time in the same node of the network. This paper introduces cost-allocation problems in a fixed-tree network with a set of agents whose activity over the nodes is fuzzy. Agent’s needs to pay for each period of time may differ. Moreover, the agents do not always remain in the same node for each period. We propose the extension of a very well-known solution for these problems: Bird’s rule.

Side Tributary Distribution of Quasi-Uniform Iterative Binary Tree Networks for River Networks

Self-similarity and plane-filling are intrinsic structure properties of natural river networks. Statistical data indicates that most natural river networks are Tokunaga trees. Researchers have explored to use iterative binary tree networks (IBTNs) to simulate natural river networks. However, the characteristics of natural rivers such as Tokunaga self-similarity and plane-filling cannot be easily guaranteed by the configuration of the IBTN. In this paper, the generator series and a quasi-uniform iteration rule are specified for the generation of nonstochastic quasi-uniform iterative binary tree networks (QU-IBTNs). First, we demonstrate that QU-IBTNs definitely satisfy self-similarity. Second, we show that the constraint for a QU-IBTN to be a Tokunaga tree is that the exterior links must be replaced in the generator series with a neighboring generator that is larger than the interior links during the iterative process. Moreover, two natural river networks are examined to reveal the inherent consistency with QU-IBTN at low Horton-Strahler orders.

NODE-WEIGHTED AVERAGE FERMAT DISTANCES OF FRACTAL TREE NETWORKS

In this paper, we investigate a class of self-similar networks modeled on a self-similar fractal tree, and use the self-similar measure and the method of finite pattern to obtain the asymptotic formula of node-weighted average Fermat distances on fractal tree networks.

On Topological Indices of Total Graph and Its Line Graph for Kragujevac Tree Networks

Kragujevac tree is indicated by K ; K ∈ K g q = s 2 t + 1 + 1 , s with order and size s 2 t + 1 + 1 and s 2 t + 1 , respectively. In this paper, we have a look at certain topological features of the total graph and line graph of the total graph of the considered tree, i.e ., Kragujevac tree, by computing different topological indices and polynomials.

On Analysis of Topological Aspects for Subdivision of Kragujevac Tree Networks

In this paper, we have taken review of certain topological topological characteristics of subdivision and the line graph of subdivision of Kragujevac tree. A Kragujevac tree is denoted by K , K ∈ Kg q = r 2 t + 1 + 1 , r , with order r 2 t + 1 + 1 and size r 2 t + 1 , respectively. We have computed the Zagreb polynomials, forgotten polynomial, and M-polynomial for Kragujevac tree. Moreover, we have computed topological indices like Zagreb-type indices, reduced reciprocal Randić indices, family of Gourava indices as well as forgotten index. Further, some topological indices that can be directly derived from M-polynomial, i.e., first and second Zagreb index, modified second Zagreb index, Randić and reciprocal Randić index, symmetric division and harmonic index, and inverse sum and augmented Zagreb index are also computed.