{'fraction_non_alphanumeric': 0.01517706576728499, 'fraction_numerical': 0.0, 'mean_word_length': 5.674157303370786, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Topological Properties of Fibonacci Networks

The Fibonacci numbers are the numbers defined by the linear recurrence equation, in which each subsequent number is the sum of the previous two. In this paper, we propose Fibonacci networks using Fibonacci numbers. The analytical expressions involving degree distribution, average path length and mean first passage time are obtained. This kind of networks exhibits the small-world characteristic and follows the exponential distribution. Our proposed models would provide the valuable insights into the deterministically delayed growing networks.