On the protected nodes in exponential recursive trees

doi:10.46298/dmtcs.10524

Mehri Javanian, Rafik Aguech

On the protected nodes in exponential recursive trees

Discrete Mathematics and Combinatorics
General Computer Science
Theoretical Computer Science

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.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

Web-based, modern reference management
Collaborate and share with fellow researchers
Integration with Overleaf
Comprehensive BibTeX/BibLaTeX support
Save articles and websites directly from your browser
Search for new articles from a database of tens of millions of references

Try out CiteDrive

On the protected nodes in exponential recursive trees

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

More from our Archive

Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs

On the protected nodes in exponential recursive trees

On the relationship between local affinities of a Boolean function and some types of its degeneracy

Short conditional complete diagnostic tests for circuits under one-type constant faults of gates

Approximation of vectorial functions over finite fields and their restrictions to linear manifolds by affine analogues

Logical extensions of the parametric closure operator

A generalized model of the Colonel Blotto stochastic game

A proof of Frankl–Kupavskii's conjecture on edge‐union condition

Adinkras for Mathematicians

PreLie-decorated hypertrees