Three Types of Network Complexity Pyramid
DOI10.1002/9783527670468.CH04zbMATH Open1328.05173OpenAlexW1484727572MaRDI QIDQ3463385FDOQ3463385
Authors: Jin-Qing Fang, Yong Li, Qiang Liu
Publication date: 14 January 2016
Published in: Advances in Network Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/9783527670468.ch04
Recommendations
- Complexity of networks
- The \(3^{*}\)-connected property of pyramid networks
- Some new topological properties of the triangular pyramid networks
- scientific article; zbMATH DE number 5846238
- Network geometry and complexity
- The triangular pyramid: Routing and topological properties
- Advances in network complexity
- Complexity of multi-architecture type of deterministic weighted generalized Farey organized network pyramids
- Measurement methods on the complexity of network
generalized Farey organized network pyramid (GFONP)life's complexity pyramid (LCP)network model complexity pyramid (NMCP)unified hybrid network theory framework
Applications of graph theory (05C90) Systems biology, networks (92C42) Random walks on graphs (05C81)
Cited In (2)
This page was built for publication: Three Types of Network Complexity Pyramid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3463385)