نتایج جستجو برای: recursive

تعداد نتایج: 28056  

‎Bucket recursive trees are an interesting and natural‎ ‎generalization of ordinary recursive trees and have a connection‎ to mathematical chemistry‎. ‎In this paper‎, ‎we give the lower and upper bounds for the moment generating‎ ‎function and moments of the multiplicative Zagreb indices in a‎ ‎randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$‎. Also, ‎we consi...

Journal: :international journal of mathematical modelling and computations 0
a. lamnii faculty of science and technology, university hassan first, settat, morocco morocco h. mraoui

in this paper, we propose to extend the hierarchical bivariatehermite interpolant to the spherical case. let $t$ be an arbitraryspherical triangle of the unit sphere $s$ and  let $u$ be a functiondefined over the triangle $t$. for $kin mathbb{n}$, we consider ahermite spherical interpolant problem $h_k$ defined by some datascheme $mathcal{d}_k(u)$ and which admits a unique solution $p_k$in the ...

Hosam M. Mahmoud,

This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...

Journal: :Annals of Pure and Applied Logic 1986

We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...

Journal: :bulletin of the iranian mathematical society 2013
m. javanian

we study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by devroye et. al (2011). in a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor ix_i floor$ where $x_0$, $ldots$ , $x_n$ is a sequence of i.i.d. random variables, with support in [0,...

Journal: :transactions on combinatorics 2014
seyed morteza mirafzal

a recursive-circulant $g(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$g(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $g(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. in this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. in particular, wewill find that the autom...

Journal: :Annals of Pure and Applied Logic 1984

Journal: :Annals of Pure and Applied Logic 1984

Journal: :Notre Dame Journal of Formal Logic 1979

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید