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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-Wiley
2017-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2017/6210878 |