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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2024-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/10524/pdf |
| _version_ | 1797269998350106624 |
|---|---|
| author | Mehri Javanian Rafik Aguech |
| author_facet | Mehri Javanian Rafik Aguech |
| author_sort | Mehri Javanian |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T01:57:17Z |
| format | Article |
| id | doaj.art-423db1134d2b4f38ac4ee307ab9ceb3c |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:57:17Z |
| publishDate | 2024-01-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-423db1134d2b4f38ac4ee307ab9ceb3c2024-03-07T15:48:46ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502024-01-01vol. 25:2Combinatorics10.46298/dmtcs.1052410524On the protected nodes in exponential recursive treesMehri Javanian0https://orcid.org/0000-0002-5737-3663Rafik Aguech1University of ZanjanUniversité de Monastir - University of MonastirThe 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.https://dmtcs.episciences.org/10524/pdf[math]mathematics [math][stat]statistics [stat] |
| spellingShingle | Mehri Javanian Rafik Aguech On the protected nodes in exponential recursive trees Discrete Mathematics & Theoretical Computer Science [math]mathematics [math] [stat]statistics [stat] |
| title | On the protected nodes in exponential recursive trees |
| title_full | On the protected nodes in exponential recursive trees |
| title_fullStr | On the protected nodes in exponential recursive trees |
| title_full_unstemmed | On the protected nodes in exponential recursive trees |
| title_short | On the protected nodes in exponential recursive trees |
| title_sort | on the protected nodes in exponential recursive trees |
| topic | [math]mathematics [math] [stat]statistics [stat] |
| url | https://dmtcs.episciences.org/10524/pdf |
| work_keys_str_mv | AT mehrijavanian ontheprotectednodesinexponentialrecursivetrees AT rafikaguech ontheprotectednodesinexponentialrecursivetrees |