Spider networks
Combinatorics
2024-10-15 v1
Abstract
In this investigation we study a family of networks, called spiders, which covers a range of networks going from chains to complete graphs. These spiders are characterized by three parameters: the number of nodes in the core, the number of legs at each core node, and the length of these legs. Keeping two of the three parameters constant we investigate if spiders are small worlds in the sense recently defined by Egghe.
Cite
@article{arxiv.2410.09440,
title = {Spider networks},
author = {Leo Egghe and Li Li and Ronald Rousseau},
journal= {arXiv preprint arXiv:2410.09440},
year = {2024}
}