http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Chandrika B.M.,Manjunatha Holaly Chandrashekara Shastry,Sridhar K.N.,Ambika M.R.,Seenappa L.,Manjunatha S.,Munirathnam R.,Lourduraj A.J. Clement 한국원자력학회 2023 Nuclear Engineering and Technology Vol.55 No.5
Barium Bismuth Oxide Borate (BBOB) has been synthesized for the first time using solution combustion technique. SEM analysis reveal flower shape of the nanoparticles. The formation of the nanoparticles has been confirmed through XRD & FTIR studies which gives the physical and chemical structure of the novel material. The UV light absorption is observed in the range 200e300 nm. The present study highlights the radiation shielding ability of BBOB for different radiations like X/Gamma rays, Bremsstrauhlung and neutrons. The gamma shielding efficiency is comparable to that of lead in lower energy range and lesser than lead in the higher energy range. The bremsstrauhlung exposure constant is comparably larger for BBOB NPs than that of concrete and steel however it is lesser than that of lead. The beauty of BBOB nanoparticles lies in, high absorption of radiations and low emission of secondary radiations when compared to lead. In addition, the neutron shielding parameters like scattering length, absorption and scattering cross sections of BBOB are found to be much better than lead, steel and concrete. Thus, BBOB nanoparticles are highly efficient in absorbing X/Gamma rays, neutrons and bremsstrauhlung radiations
Centroidal mean labeling of graphs-II
R. SAMPATHKUMAR,K. M. Nagaraja,G. Narasimhan,M. H. Ambika 장전수학회 2020 Proceedings of the Jangjeon mathematical society Vol.23 No.2
In this paper the Centroidal mean labeling of graphs such as triangu- lar snake Tn K1, double triangular snake Dn(Tn) K1, TLn K1, the graph obtained by attaching pendent edges to both sides of each vertex of a path Pn; attaching paths of lengths 0; 1; 2; 3; : : : ; n - 1 on both sides of each vertex of Pn; D2(Pn); Middle graph of path Pn; Total graph of path Pn; Splitting graph of path Pn and Duplicating each vertex by an edge in path Pn are discussed.