نتایج جستجو برای: the colored
تعداد نتایج: 16054822 فیلتر نتایج به سال:
0196-8904/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.enconman.2012.12.002 ⇑ Corresponding author. Tel.: +60 3 79675212; fax: E-mail addresses: [email protected] (M.A. Fazal), Haseeb), [email protected] (H.H. Masjuki). Use of biodiesel in automobile engine is creating tribology related new challenges. The present study aims to assess the friction and wear characteristics o...
This paper reports on the development of a high-speed electrical machine which can be used as motor or generator for application in micro heat engines. The machine has a rated power of 200 W at a rotational speed of 600 000 rpm and is supported by self-acting air bearings. The design process outlined in the paper focuses on aspects such as electromagnetic design, bearing design, rotordynamic be...
Properly colored cycles in edge-colored graphs are closely related to directed oriented graphs. As an analogy of the well-known Caccetta–Häggkvist Conjecture, we study existence properly bounded length graph. We first prove that for all integers s and t with ≥ 2 , every graph G no K contains a spanning subgraph H which admits orientation D such cycle is . Using this result, show r 4 if Conjectu...
The study of problems modeled by edge-colored graphs has given rise to important developments during the last few decades. For instance, the investigation of spanning trees for graphs provide important and interesting results both from a mathematical and an algorithmic point of view (see for instance [1]). From the point of view of applicability, problems arising in molecular biology are often ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید