Ferromagnetic ordering in graphs with arbitrary degree distribution
✍ Scribed by M. Leone; A. Vázquez; A. Vespignani; R. Zecchina
- Book ID
- 111620302
- Publisher
- Springer
- Year
- 2002
- Tongue
- English
- Weight
- 174 KB
- Volume
- 28
- Category
- Article
- ISSN
- 1434-6036
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 graph G has constant link L if for each vertex x of. G the graph induced by G on the, vertices adjacent to x is isomorphic to L. For each graph L on 6 or fewer vertices w e decide whether or not there exists a graph G with constant link L. From this w e are able to list all graphs on 11 or fewer