Structure Properties of Koch Networks Based on Networks Dynamical Systems
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 routi...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2017-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2017/6210878 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832561844818018304 |
---|---|
author | Yinhu Zhai Jia-Bao Liu Shaohui Wang |
author_facet | Yinhu Zhai Jia-Bao Liu Shaohui Wang |
author_sort | Yinhu Zhai |
collection | DOAJ |
description | 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. |
format | Article |
id | doaj-art-5f5fa4dcf5244fba952a05b043eb9be6 |
institution | Kabale University |
issn | 1076-2787 1099-0526 |
language | English |
publishDate | 2017-01-01 |
publisher | Wiley |
record_format | Article |
series | Complexity |
spelling | doaj-art-5f5fa4dcf5244fba952a05b043eb9be62025-02-03T01:24:08ZengWileyComplexity1076-27871099-05262017-01-01201710.1155/2017/62108786210878Structure Properties of Koch Networks Based on Networks Dynamical SystemsYinhu Zhai0Jia-Bao Liu1Shaohui Wang2School of Information Engineering, Guangdong University of Technology, Guangzhou 510006, ChinaSchool of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, ChinaDepartment of Mathematics and Computer Science, Adelphi University, Garden City, NY 11530, USAWe 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.http://dx.doi.org/10.1155/2017/6210878 |
spellingShingle | Yinhu Zhai Jia-Bao Liu Shaohui Wang Structure Properties of Koch Networks Based on Networks Dynamical Systems Complexity |
title | Structure Properties of Koch Networks Based on Networks Dynamical Systems |
title_full | Structure Properties of Koch Networks Based on Networks Dynamical Systems |
title_fullStr | Structure Properties of Koch Networks Based on Networks Dynamical Systems |
title_full_unstemmed | Structure Properties of Koch Networks Based on Networks Dynamical Systems |
title_short | Structure Properties of Koch Networks Based on Networks Dynamical Systems |
title_sort | structure properties of koch networks based on networks dynamical systems |
url | http://dx.doi.org/10.1155/2017/6210878 |
work_keys_str_mv | AT yinhuzhai structurepropertiesofkochnetworksbasedonnetworksdynamicalsystems AT jiabaoliu structurepropertiesofkochnetworksbasedonnetworksdynamicalsystems AT shaohuiwang structurepropertiesofkochnetworksbasedonnetworksdynamicalsystems |