Structure properties of Koch networks based on networks dynamical systems
From MaRDI portal
Publication:2012816
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.
Recommendations
- Establishment and structure properties of a scale-free Koch network
- Properties and applications of Laplacian spectra for Koch networks
- Multifractal analysis and topological properties of a new family of weighted Koch networks
- scientific article; zbMATH DE number 5504374
- Network structure and some related properties based on lattice theory
- scientific article; zbMATH DE number 26627
- Networks describing dynamical systems
- Complex networks approach for dynamical characterization of nonlinear systems
Cites work
- A generalized volume dimension of complex networks
- Cayley graphs as models of deterministic small-world networks
- Collective dynamics of `small-world' networks
- Determination of multifractal dimensions of complex networks by means of the sandbox algorithm
- Deterministic scale-free networks
- Deterministic small-world communication networks
- Emergence of Scaling in Random Networks
- Fractal and complex network analyses of protein molecular dynamics
- Hierarchical regular small-world networks
- Impact of degree heterogeneity on the behavior of trapping in Koch networks
- Label-based routing for a family of scale-free, modular, planar and unclustered graphs
- Mapping Koch curves into scale-free small-world networks
- Multifractality and Laplace spectrum of horizontal visibility graphs constructed from fractional Brownian motions
- Multiplicative Zagreb indices of \(k\)-trees
- On degree resistance distance of cacti
- Vertex labeling and routing in expanded Apollonian networks
- Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
- Zagreb indices and multiplicative Zagreb indices of Eulerian graphs
Cited in
(8)- On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree
- Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
- Vertex labeling and routing in expanded Apollonian networks
- Extremal first leap Zagreb index of \(k\)-generalized quasi-trees
- Study of the Kohonen network with a discrete state space
- Properties and applications of Laplacian spectra for Koch networks
- scientific article; zbMATH DE number 1728667 (Why is no real title available?)
- Models and dynamics of deterministically growing networks
This page was built for publication: Structure properties of Koch networks based on networks dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012816)
