On Terminal Nodes and the Degree Profile of Preferential Dynamic Attachment Circuits

DOI10.1137/1.9781611974324.9zbMath1433.05296OpenAlexW2295808760MaRDI QIDQ5194945

Panpan Zhang

Publication date: 17 September 2019

Published in: 2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974324.9

zbMATH Keywords

phase transitionsterminal nodes

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Enumeration in graph theory (05C30)

Related Items (3)

ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES ⋮ On nodes of small degrees and degree profile in preferential dynamic attachment circuits ⋮ On several properties of a class of hybrid recursive trees

This page was built for publication: On Terminal Nodes and the Degree Profile of Preferential Dynamic Attachment Circuits