نتایج جستجو برای: order general randic index

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت دبیر شهید رجایی - دانشکده علوم انسانی 1393

according to research, academic self-concept and academic achievement are mutually interdependent. in the present study, the aim was to determine the relationship between the academic self-concept and the academic achievement of students in english as a foreign language and general subjects. the participants were 320 students studying in 4th grade of high school in three cities of noor, nowshah...

Journal: :International Journal of Mathematics and Mathematical Sciences 1984

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه زنجان - دانشکده ادبیات و علوم انسانی 1392

abstract the present study investigated the effects of task types and involvement load hypothesis on incidental learning of 10 target words (tws) in junior high schools (jhss) in givi, ardabil. the tasks deployed in this study were two input-based tasks (reading plus dictionary use with an involvement index of 3, and reading plus gap-fill task with an involvement index of 2), and one output-ba...

پایان نامه :دانشگاه تربیت معلم - تهران - دانشکده علوم 1393

in this thesis, structural, electronical, and optical properties of inverse pervskite(ca3pbo) in cubic phase have been investigated.the calculation have been done based on density functional theory and according to generalized gradiant approximate (gga) as correlating potential. in order to calculate the configurations, implementing in the wien2k code have been used from 2013 version. first of ...

Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...

Journal: :Discrete Applied Mathematics 2003
Juan Rada Carlos Uzcátegui

Let G be a collection of graphs with n vertices. We present a simple description of [G]χ = {H ∈ G : χ(H) = χ(G)} where χ denotes the Randić index. We associate to G a Q-linear map ρ : Qm → Qk (for some integers k, m depending on G) such that the kernel of ρ contains the necessary information to describe [G]χ in terms of linear equations. These results provide precise tools for analyzing the beh...

Journal: :Journal of Inequalities and Applications 2013

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

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