نتایج جستجو برای: wiener h

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

Journal: :iranian journal of mathematical chemistry 2011
z. sadri irani a. karbasioun

let g be a molecular graph. the wiener index of g is defined as the summation of alldistances between vertices of g. in this paper, an exact formula for the wiener index of a newtype of nanostar dendrimer is given.

Journal: :Discussiones Mathematicae Graph Theory 2012
S. Arockiaraj Kumarappan Kathiresan

A positive integer n is said to be Wiener graphical, if there exists a graph G with Wiener index n. In this paper, we prove that any positive integer n( 6= 2, 5) is Wiener graphical. For any positive integer p, an interval [a, b] is said to be a p-Wiener interval if for each positive integer n ∈ [a, b] there exists a graph G on p vertices such that W (G) = n. For any positive integer p, an inte...

Journal: :Stochastic Analysis and Applications 2021

In a recent paper by Yu (arXiv:2008.05633, 2020), higher order derivatives of self-intersection local time fractional Brownian motion were defined, and existence over certain regions the Hurst parameter $H$ was proved. Utilizing Wiener chaos expansion, we provide new proofs Yu's results, show how Varadhan-type renormalization can be used to extend range convergence for even derivatives.

2005
Rimantas PUPEIKIS

Special classes of nonlinear systems applied in engineering are nonlinear systems with both block-oriented Hammerstein and Wiener structures, respectively [1, 3, 4, 7, 8, 14]. There are a lot of papers devoted to the different aspects of the parametric identification of Hammerstein and Wiener systems and much less on that of the Hammerstein–Wiener (H-W) systems with so-called hard nonlinearitie...

2009
Hyrum S. Anderson Maya R. Gupta

We investigate a Wiener fusion method to optimally combine multiple estimates for the problem of image deblurring given a known blur and a corpus of sharper training images. Nearest-neighbor estimation of high frequency information from training images is fused with a standard Wiener deconvolution estimate. Results show an improvement in sharpness and decreased artifacts compared to either the ...

2007
B. ZMAZEK

Formulas for the Wiener number and the Hosoya-Wiener polynomial of edge and vertex weighted graphs are given in terms of edge and path contributions. For a rooted tree, the Hosoya-Wiener polynomial is expressed as a sum of vertex contributions. Finally, a recursive formula for computing the Hosoya-Wiener polynomial of a weighted tree is given.

2017
Seiichi Nakamori

This paper designs the recursive least-squares (RLS) Wiener finite impulse response (FIR) predictor and filter, based on the innovation approach, in linear discrete-time stochastic systems. It is assumed that the signal is observed with additive white noise and the signal process is uncorrelated with the observation noise process. This paper also presents the recursive algorithms for the estima...

Journal: :محیط زیست طبیعی 0
مرضیه نوبخت دانش آموخته کارشناسی ارشد، دانشکده منابع طبیعی، دانشگاه گیلان، ایران حسن پوربابایی دانشیار دانشکده منابع طبیعی، دانشگاه گیلان، ایران مرضیه بیگم فقیر عضو هیأت علمی دانشکده علوم پایه، دانشگاه گیلان، ایران رویا عابدی دانش آموخته کارشناسی ارشد، دانشکده منابع طبیعی، دانشگاه گیلان، ایران

in order to investigate variations in plant diversity in dr. dorostkar's forest reservoir, located in gisoum talesh, 44 sampling plots were applied by the randomized-systematic method. the diameter of all tree species (dbh?5 cm) was measured in 400 m2 (20×20 m) square sampling plots. in addition, the number of individuals of shrubs and saplings (dbh?5 cm) were enumerated in circular 100 m2...

ژورنال: محاسبات نرم 2016

Let G=(V,E) be a graph where v(G) and E(G) are vertices and edges of G, respectively. Sum of distance between vertices of graphs is called wiener invariant. In This paper, we present some proved results on the wiener invariant and some new result on the upper bound of wiener invariant of k-connected graphs.

Journal: :JTAM (Jurnal Teori dan Aplikasi Matematika) 2023

Assuming that G is a finite group and H subgroup of G, the graph known as relative coprime with respect to (denoted Γ_(G,H)) has vertices corresponding elements G. Two distinct x y are adjacent by an edge if only (|x|,|y|)=1 or belongs H. This paper will focus on finding general formula for some topological indices dihedral group. The study in theory offers valuable insights into structural pro...

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

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