Structure Properties of Koch Networks Based on Networks Dynamical Systems
arXiv:1610.03705
Abstract
We introduce an informative labeling algorithm for the vertices of a family of Koch networks. Each of the labels is consisted of two parts, the precise position and the time adding to Koch networks. The shortest path routing between any two vertices is determined only on the basis of their labels, and the routing is calculated only by few computations. The rigorous solutions of betweenness centrality for every node and edge are also derived by the help of their labels. Furthermore, the community structure in Koch networks is studied by the current and voltage characteristics of its resistor networks.
References in corpus (12)
- Emergence of scaling in random networks
- Deterministic Scale-Free Networks
- A Geometric Fractal Growth Model for Scale Free Networks
- Self-similar disk packings as model spatial scale-free networks
- Hierarchical, Regular Small-World Networks
- Exactly solvable scale-free network model
- Integer Networks
- Families and clustering in a natural numbers network
- A Small World Network of Prime Numbers
- Impact of degree heterogeneity on the behavior of trapping in Koch networks
- Multifractality and Laplace spectrum of horizontal visibility graphs constructed from fractional Brownian motions
- Multiplicative Zagreb indices of cacti