نتایج جستجو برای: روش nikiforov
تعداد نتایج: 369767 فیلتر نتایج به سال:
Ohno, H., Koga, H., Kohno, S.. Higashiyama, Y., Miyazaki, Y., Ogawa, K., Yanagihra, K., Yamamoto, Y., Noda, T. & Miyamoto, J. (1994), Evaluation for rapid detection of rifampiein-rcsistant MycobacteHum tuberculosis by polymerase chain reaction-single strand conformation polymorphism. Kekkaku, 69, 773-778. Predieh, M., Doukhan, L., Nair, G. & Smith, I. (1995), Characterization of RNA polymerase ...
In this study, the Schrödinger equation with Hulthén plus screened Kratzer potentials (HSKP) are solved via Nikiforov-Uvarov (NU) and series expansion methods. We obtained energy wave function in closed form Greene-Aldrich approximation NU method. The method was also used to obtain of HSKP. Three distinct cases were from combined potentials. eigenvalues HSKP for HCl, LiH, H2, NO diatomic molecu...
Let G be a graph of order n and let q (G) be the largest eigenvalue of the signless Laplacian of G. Let Sn,k be the graph obtained by joining each vertex of a complete graph of order k to each vertex of an independent set of order n − k; and let S n,k be the graph obtained by adding an edge to Sn,k. It is shown that if k ≥ 2, n ≥ 400k2, and G is a graph of order n, with no cycle of length 2k + ...
Fifty years ago Erdős asked to determine the minimum number of k-cliques in a graph on n vertices with independence number less than l. He conjectured that this minimum is achieved by the disjoint union of l− 1 complete graphs of size n l−1 . This conjecture was disproved by Nikiforov who showed that the balanced blow-up of a 5-cycle has fewer 4-cliques than the union of 2 complete graphs of si...
هدف: هدف پژوهش حاضر تعیین نقش واسطهای اجتناب تجربی و دشواریهای تنظیم هیجان در رابطه بین سازوکارهای دفاعی با افکار خودکشی نوجوانان بود. روش: از نوع توصیفی- همبستگی جامعه آماری این شامل تمام شهر کرج پاییز سال 1398 بود که میان آنها به روش نمونه گیری دسترس مناطق آموزشی 3 7، 270 نوجوان 15 تا 18 (125 پسر 143 دختر) انتخاب شدند. ابزار پرسشنامه دفاعی-40 آندروز همکاران (۱۹93) (DSQ-40)؛ دشواری گراتز ...
Two graphs having the same spectrum are said to be cospectral. A pair of singularly cospectral is formed by two such that absolute values their nonzero eigenvalues coincide. Clearly, a also but converse may not true. almost if and multiplicities In this paper, we present necessary sufficient conditions for cospectral, giving an answer problem posted Nikiforov. addition, construct infinite famil...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید