Medium worlds theories I

摘要

Refining the results from the work of Comellas et al. regarding deterministic small-world networks, and intending to apply results deduced from theirs into traffic networks, we introduce new constraints, extend their work to networks of circulants, criticize the choice of the name ‘small worlds’ for large circulants, with a number greater than 64 for their vertices and, as a side result, we introduce a new form of graph: starants as a replacement of the circulants for the case of disease spread and social networks. In order to reach our goals we make use of standard combinatorial tools, graph analysis, and general algebraic procedures.