Cargando…
Structure Properties of Generalized Farey graphs based on Dynamical Systems for Networks
Farey graphs are simultaneously small-world, uniquely Hamiltonian, minimally 3-colorable, maximally outerplanar and perfect. Farey graphs are therefore famous in deterministic models for complex networks. By lacking of the most important characteristics of scale-free, Farey graphs are not a good mod...
Autores principales: | Jiang, Wenchao, Zhai, Yinhu, Martin, Paul, Zhao, Zhiming |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6093942/ https://www.ncbi.nlm.nih.gov/pubmed/30111775 http://dx.doi.org/10.1038/s41598-018-30712-2 |
Ejemplares similares
-
Label-based routing for a family of small-world Farey graphs
por: Zhai, Yinhu, et al.
Publicado: (2016) -
From Farey sequences to resonance diagrams
por: Tomás, R
Publicado: (2014) -
Farey sequences: duality and maps between subsequences
por: Matveev, Andrey O
Publicado: (2017) -
Formulas and algorithms for the length of a Farey sequence
por: Sukhoy, Vladimir, et al.
Publicado: (2021) -
Farey Trees Explain Sequential Effects in Choice Response Time
por: Annand, Colin T., et al.
Publicado: (2021)