On the protected nodes in exponential recursive trees
The exponential recursive trees model several kinds of networks. At each step of growing of these trees, each node independently attracts a new node with probability p, or fails to do with probability 1 − p. Here, we investigate the number of protected nodes, total path length of protected nodes, an...
Gespeichert in:
Veröffentlicht in: | Discrete mathematics and theoretical computer science 2023-01, Vol.25:2 (Combinatorics), p.1-16 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The exponential recursive trees model several kinds of networks. At each step of growing of these trees, each node independently attracts a new node with probability p, or fails to do with probability 1 − p. Here, we investigate the number of protected nodes, total path length of protected nodes, and a mean study of the protected node profile of such trees. |
---|---|
ISSN: | 1365-8050 1462-7264 1365-8050 |
DOI: | 10.46298/dmtcs.10524 |