نتایج جستجو برای: coloring agents

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

Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...

Journal: :research in pharmaceutical sciences 0
m amanlou s keivani b sadri o gorban-dadras e souri

in the present study, a simple and sensitive extractive spectrophotometric method is described for determination of buspirone. the method is based on the reaction of buspirone and bromocresol green. the ion-pair complex was quantitatively extracted into chloroform at ph 2.3 followed by spectrophotometric determination at 415 nm. the complex was stable up to 2 days and obeyed beer's law over the...

Journal: :iranian journal of pharmaceutical sciences 0
massoud amanlou department of medicinal chemistry, faculty of pharmacy, and pharmaceutical sciences research center, tehran university of medical sciences, tehran, iran effat souri department of medicinal chemistry, faculty of pharmacy, and pharmaceutical sciences research center, tehran university of medical sciences, tehran, iran shiva izady department of medicinal chemistry, faculty of pharmacy, and pharmaceutical sciences research center, tehran university of medical sciences, tehran, iran hassan farsam department of medicinal chemistry, faculty of pharmacy, and pharmaceutical sciences research center, tehran university of medical sciences, tehran, iran

a simple and sensitive extractive spectrophotometric method is described for determination of tropicamide. the method is based on the reaction of tropicamide and bromocresol green. the ion-paired colored complex was extracted with chloroform at ph 3. the extracted complex showed maximum absorbance at 423 nm. the complex was stable up to 2 days and obeyed beer's law over the concentration r...

Journal: :iranian journal of radiation research 0
j. k. kim advanced radiation technology institute, korea atomic energy research institute, jeongeup 580-185, republic of korea m. k. kim department of food science and human nutrition, chonbuk national university, 567 baekjedaero, deokjin-gu, jeonju-si, chonbuk, 54896, republic of korea k. g. lee department of food science and biotechnology, dongguk university-seoul campus, 32, dongguk-ro, ilsandong-gu, goyang-si, 410-820, south korea

4-methylimidazole (4-mei) is a simple nitrogen-containing heterocyclic compound, and recently classified as group 2b by international agency for research on cancer (iarc). caramel coloring is widely applied food coloring in many food products including coffee, carbonated beverages, beer and wine. in present study, ɣ-irradiation was applied to caramel color iii to reduce the level of 4-mei witho...

Effat Souri, Hassan Farsam Massoud Amanlou, Shiva Izady

     A simple and sensitive extractive spectrophotometric method is described for determination of tropicamide. The method is based on the reaction of tropicamide and bromocresol green. The ion-paired colored complex was extracted with chloroform at pH 3. The extracted complex showed maximum absorbance at 423 nm. The complex was stable up to 2 days and obeyed Beer's law over the concentration r...

J. K. Kim, K. G. Lee, M. K. Kim,

4-Methylimidazole (4-MEI) is a simple nitrogen-containing heterocyclic compound, and recently classified as group 2B by International Agency for Research on Cancer (IARC). Caramel coloring is widely applied food coloring in many food products including coffee, carbonated beverages, beer and wine. In present study, ɣ-irradiation was applied to Caramel Color III to reduce the level of 4-MEI witho...

Journal: :bulletin of the iranian mathematical society 2012
x. zhang g. liu j. l. wu

a proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. a graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $g$ such that each vertex receives a color from its own list. in this paper, we prov...

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

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