The degree profile and weight in Apollonian networks and k-trees

Publisher： Cambridge University Press

E-ISSN： 1475-6064|48|1|163-175

ISSN： 0001-8678

Source： Advances in Applied Probability, Vol.48, Iss.1, 2016-03, pp. : 163-175

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

DEGREE PROFILE OF HIERARCHICAL LATTICE NETWORKS

By  

Probability in the Engineering and Informational Sciences, Vol. 31, Iss. 1, 2016-09 ,pp. : 60-82

Cambridge University Press

Access to resources Recommend Favorite

Minimum degree and minimum number of edge-disjoint trees

By Llado A.   Lopez S.C.  

Discrete Mathematics, Vol. 275, Iss. 1, 2004-01 ,pp. : 195-205

Elsevier

Access to resources Recommend Favorite

Irreducible Apollonian Configurations and Packings

By Butler Steve   Graham Ron   Guettler Gerhard   Mallows Colin  

Discrete & Computational Geometry, Vol. 44, Iss. 3, 2010-10 ,pp. : 487-507

Springer Publishing Company

Access to resources Recommend Favorite

On the apollonian metric of domains in

By  

Complex Variables, Vol. 48, Iss. 10, 2003-10 ,pp. : 1-1

Taylor & Francis Ltd

Access to resources Recommend Favorite

TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER

By  

Bulletin of the Australian Mathematical Society, Vol. 81, Iss. 2, 2010-04 ,pp. : 350-352

Cambridge University Press

Access to resources Recommend Favorite