×

Structure properties of Koch networks based on networks dynamical systems. (English) Zbl 1367.05191

Summary: 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.

MSC:

05C78 Graph labelling (graceful graphs, bandwidth, etc.)
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Watts, D. J.; Strogatz, S. H., Collective dynamics of ’small-world’ networks, Nature, 393, 6684, 440-442 (1998) · Zbl 1368.05139
[2] Barabási, A.-L.; Albert, R., Emergence of scaling in random networks, Science, 286, 5439, 509-512 (1999) · Zbl 1226.05223
[3] Comellas, F.; Ozón, J.; Peters, J. G., Deterministic small-world communication networks, Information Processing Letters, 76, 1-2, 83-90 (2000) · Zbl 1338.68012
[4] Barabási, A.-L.; Ravasz, E.; Vicsek, T., Deterministic scale-free networks, Physica A: Statistical Mechanics and its Applications, 299, 3-4, 559-564 (2001) · Zbl 0972.57003
[5] Jung, S.; Kim, S.; Kahng, B., Geometric fractal growth model for scale-free networks, Physical Review E, 65, 5 (2002)
[6] Corso, G., Families and clustering in a natural numbers network, Physical Review E, 69, 3 (2004)
[7] Chandra, A. K.; Dasgupta, S., A small world network of prime numbers, Physica A. Statistical Mechanics and its Applications, 357, 3-4, 436-446 (2005)
[8] Iguchi, K.; Yamada, H., Exactly solvable scale-free network model, Physical Review E, 71, 3 (2005)
[9] Doye, J. P.; Massen, C. P., Self-similar disk packings as model spatial scale-free networks, Physical Review E. Statistical, Nonlinear, and Soft Matter Physics, 71, 1 (2005)
[10] Andrade, J. S.; Herrmann, H. J.; Andrade, R. F.; Da Silva, L. R., Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs, Physical Review Letters, 94, 1 (2005)
[11] Xiao, W.; Parhami, B., Cayley graphs as models of deterministic small-world networks, Information Processing Letters, 97, 3, 115-117 (2006) · Zbl 1184.68060
[12] Zhou, T.; Wang, B.-H.; Hui, P. M.; Chan, K. P., Topological properties of integer networks, Physica A: Statistical Mechanics and Its Applications, 367, 613-618 (2006)
[13] Zhang, Z.-Z.; Zhou, S.-G.; Zou, T., Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices, European Physical Journal B, 56, 3, 259-271 (2007)
[14] Boettcher, S.; Gonçalves, B.; Guclu, H., Hierarchical regular small-world networks, Journal of Physics. A. Mathematical and Theoretical, 41, 25 (2008) · Zbl 1198.82016
[15] Comellas, F.; Miralles, A., Modeling complex networks with self-similar outerplanar unclustered graphs, Physica A. Statistical Mechanics and its Applications, 388, 11, 2227-2233 (2009)
[16] Wang, S.; Wei, B., Multiplicative Zagreb indices of k-trees, Discrete Applied Mathematics, 180, 168-175 (2015) · Zbl 1303.05034
[17] Liu, J.-B.; Wang, C.; Wang, S.; Wei, B., Zagreb indices and multiplicative zagreb indices of eulerian graphs, Bulletin of the Malaysian Mathematical Sciences Society (2017) · Zbl 1406.05020
[18] Liu, J.; Wang, S.; Wang, C.; Hayat, S., Further results on computation of topological indices of certain networks, IET Control Theory & Applications (2017)
[19] von Koch, H., Une mthode gomtrique lmentaire pour ltude de certaines questions de la thorie descourbes planes, Acta Mathematica, 30, 1, 145-174 (1906) · JFM 37.0413.02
[20] Zhang, Z.; Gao, S.; Chen, L.; Zhou, S.; Zhang, H.; Guan, J., Mapping Koch curves into scale-free small-world networks, Journal of Physics. A. Mathematical and Theoretical, 43, 39 (2010) · Zbl 1213.28004
[21] Wei, D.; Deng, X.; Zhang, X.; Deng, Y.; Mahadevan, S., Identifying influential nodes in weighted networks based on evidence theory, Physica A: Statistical Mechanics and its Applications, 392, 10, 2564-2575 (2013)
[22] Wei, D.-J.; Liu, Q.; Zhang, H.-X.; Hu, Y.; Deng, Y.; Mahadevan, S., Box-covering algorithm for fractal dimension of weighted networks, Scientific Reports, 3, article 3049 (2013)
[23] Wei, D.; Wei, B.; Zhang, H.; Gao, C.; Deng, Y., A generalized volume dimension of complex networks, Journal of Statistical Mechanics: Theory and Experiment, 2014, 10 (2014)
[24] Zhang, Z.; Gao, S.; Xie, W., Impact of degree heterogeneity on the behavior of trapping in Koch networks, Chaos, 20, 4 (2010) · Zbl 1311.05175
[25] Yu, Z.-G.; Zhang, H.; Huang, D.-W.; Lin, Y.; Anh, V., Multifractality and Laplace spectrum of horizontal visibility graphs constructed from fractional Brownian motions, Journal of Statistical Mechanics: Theory and Experiment, 2016 (2016) · Zbl 1456.82634
[26] Song, Y.-Q.; Liu, J.-L.; Yu, Z.-G.; Li, B.-G., Multifractal analysis of weighted networks by a modified sandbox algorithm, Scientific Reports, 5, article 17628 (2015)
[27] Liu, J.-L.; Yu, Z.-G.; Anh, V., A generalized volume dimension of complex networks. Determination of multifractal dimensions of complex networks by means of the sandbox algorithm, Chaos, 25, 2 (2015)
[28] Li, B.; Yu, Z.; Zhou, Y., Fractal and multifractal properties of a family of fractal networks, Journal of Statistical Mechanics: Theory and Experiment, 2014, 2 (2014)
[29] Zhou, Y.-W.; Liu, J.-L.; Yu, Z.-G.; Zhao, Z.-Q.; Anh, V., Multifractal and complex network analysis of protein dynamics, Physica A: Statistical Mechanics and Its Applications, 416, 21-32 (2014)
[30] Zhang, Z.; Comellas, F.; Fertin, G.; Raspaud, A.; Rong, L.; Zhou, S., Vertex labeling and routing in expanded Apollonian networks, Journal of Physics. A. Mathematical and Theoretical, 41, 3 (2008) · Zbl 1152.90359
[31] Comellas, F.; Miralles, A., Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks, Journal of Physics. A. Mathematical and Theoretical, 42, 42 (2009) · Zbl 1180.90032
[32] Comellas, F.; Miralles, A., Label-based routing for a family of scale-free, modular, planar and unclustered graphs, Journal of Physics A: Mathematical and Theoretical, 44, 20 (2011) · Zbl 1226.05212
[33] Comellas, F.; Fertin, G.; Raspaud, A., Vertex labeling and routing in recursive clique-trees, a new family of small-world scale-free graphs, Proceedings of the 10th International Colloquium on Structural Information & Communication Complexity (SIROCCO ’03)
[34] Zhai, Y.; Wang, Y., Label-based routing for a family of small-world Farey graphs, Scientific Reports, 6, article 25621 (2016)
[35] Newman, M. E. J., Detecting community structure in networks, European Physical Journal B, 38, 2, 321-330 (2004)
[36] Newman, M. E. J., A measure of betweenness centrality based on random walks, Social Networks, 27, 1, 39-54 (2005)
[37] Liu, J.-B.; Cao, J., The resistance distances of electrical networks based on Laplacian generalized inverse, Neurocomputing, 167, 306-313 (2015)
[38] Liu, J.-B.; Wang, W.-R.; Zhang, Y.-M.; Pan, X.-F., On degree resistance distance of cacti, Discrete Applied Mathematics. The Journal of Combinatorial Algorithms, Informatics and Computational Sciences, 203, 217-225 (2016) · Zbl 1332.05048
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.