Integer Networks
Inspired by Pythagoras's belief that numbers are the absolute reality, we obtain some demonstrational results about topological properties of integer networks, in which the vertices represent integers and two vertices are neighbors if and only if there exists a divisibility relation between them. We strictly prove that the diameter of networks has a constant upper bound independent to the network size $N$, which is completely different from the extensively studied real-life networks with their average distance increasing logarithmically to $N$ as $L\sim \texttt{ln}N$ or $L\sim \texttt{lnln}N$. Further more, the integer networks is high clustered, with clustered coefficient $C\approx 0.34$, and display power-law degree distribution of exponent $γ\approx 2.4$.