Structure Properties of Koch Networks Based on Networks Dynamical Systems

Yinhu Zhai, Jia-Bao Liu and Shaohui Wang

Complexity, 2017, vol. 2017, 1-7

Abstract:

We introduce an informative labeling algorithm for the vertices of a family of Koch networks. Each label consists 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 characterizations of its resistor networks.

Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2017/6210878.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2017/6210878.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:6210878

DOI: 10.1155/2017/6210878

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().