Generation of networks with prescribed degree-dependent clustering
β Scribed by Chrysanthos E. Gounaris; Karthikeyan Rajendran; Ioannis G. Kevrekidis; Christodoulos A. Floudas
- Book ID
- 107403360
- Publisher
- Springer-Verlag
- Year
- 2011
- Tongue
- English
- Weight
- 302 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1862-4472
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The degree set π^G^ of a graph __G__ is the set of degrees of the vertices of __G.__ For a finite nonempty set __S__ of positive integers, all positive integers __p__ are determined for which there exists a graph __G__ of order __p__ such that π^G^ = __S__.
The degree profile of an edge e of a finite hypergraph H is the map assigning to a positive integer i the number of vertices of degree i incident with e. The edge degree profile of H is the map describing for any possible degree profile ~ the number of edges in H with degree profile ~. A necessary a