Spider networks
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917801310027776 |
|---|---|
| author | Egghe, Leo Li, Li Rousseau, Ronald |
| author_facet | Egghe, Leo Li, Li Rousseau, Ronald |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_09440 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Spider networks Egghe, Leo Li, Li Rousseau, Ronald Combinatorics 05C82 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. |
| title | Spider networks |
| topic | Combinatorics 05C82 |
| url | https://arxiv.org/abs/2410.09440 |