Branches in scale-free trees
From MaRDI portal
Publication:844535
DOI10.1007/S10958-009-9615-8zbMATH Open1179.05099OpenAlexW1998007190MaRDI QIDQ844535FDOQ844535
Authors: M. Dondajewski, Jerzy Szymański
Publication date: 19 January 2010
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-009-9615-8
Recommendations
Cites Work
- The degree sequence of a scale-free random graph process
- On the structure of random plane‐oriented recursive trees and their branches
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concentration of vertex degrees in a scale‐free random graph process
Cited In (9)
- Title not available (Why is that?)
- Width of a scale-free tree
- Scale functions and tree ends
- Random recursive trees and preferential attachment trees are random split trees
- Phase changes in the topological indices of scale-free trees
- Tree-length equals branch-length
- Title not available (Why is that?)
- Scale-free random branching trees in supercritical phase
- Levels of a scale-free tree
This page was built for publication: Branches in scale-free trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844535)