%0 Journal Article %1 WOS:000240374100011 %A Soares, Danyel J B %A Jr., Jose S Andrade %A Herrmann, Hans J %A da Silva, Luciano R %C 5 TOH TUCK LINK, SINGAPORE 596224, SINGAPORE %D 2006 %I WORLD SCIENTIFIC PUBL CO PTE LTD %J INTERNATIONAL JOURNAL OF MODERN PHYSICS C %K betweenness} clustering coefficient; connectivity exponent; network; path; shortest vertex {Apollonian %N 8 %P 1219-1226 %R 10.1142/S0129183106009175 %T Three-dimensional Apollonian networks %V 17 %X We discuss the three-dimensional Apollonian network introduced by Andrade et al.(1) for the two-dimensional case. These networks are simultaneously scale-free, small world, Euclidean, space-filling and matching graphs and have a wide range of applications going from the description of force chains in polydisperse granular packings to the geometry of fully fragmented porous media. Some of the properties of these networks, namely, the connectivity exponent, the clustering coefficient, the shortest path, and vertex betweenness are calculated and found to be particularly rich.

@article{WOS:000240374100011, abstract = {We discuss the three-dimensional Apollonian network introduced by Andrade et al.(1) for the two-dimensional case. These networks are simultaneously scale-free, small world, Euclidean, space-filling and matching graphs and have a wide range of applications going from the description of force chains in polydisperse granular packings to the geometry of fully fragmented porous media. Some of the properties of these networks, namely, the connectivity exponent, the clustering coefficient, the shortest path, and vertex betweenness are calculated and found to be particularly rich.}, added-at = {2022-05-23T20:00:14.000+0200}, address = {5 TOH TUCK LINK, SINGAPORE 596224, SINGAPORE}, author = {Soares, Danyel J B and Jr., Jose S Andrade and Herrmann, Hans J and da Silva, Luciano R}, biburl = {https://www.bibsonomy.org/bibtex/2f2a0f34602c5fb453087b0380ac0026c/ppgfis_ufc_br}, doi = {10.1142/S0129183106009175}, interhash = {e8ab58bffce1892bf4f92bd0665467cf}, intrahash = {f2a0f34602c5fb453087b0380ac0026c}, issn = {0129-1831}, journal = {INTERNATIONAL JOURNAL OF MODERN PHYSICS C}, keywords = {betweenness} clustering coefficient; connectivity exponent; network; path; shortest vertex {Apollonian}, number = 8, pages = {1219-1226}, publisher = {WORLD SCIENTIFIC PUBL CO PTE LTD}, pubstate = {published}, timestamp = {2022-05-23T20:00:14.000+0200}, title = {Three-dimensional Apollonian networks}, tppubtype = {article}, volume = 17, year = 2006 }