理学 >>> 数学 信息科学与系统科学 物理学 化学 天文学 地球科学总论 大气科学 地球物理学 地理学 地质学 水文学 海洋科学 生物学 科学技术史
搜索结果: 1-15 共查到理学 Rainbow相关记录31条 . 查询时间(0.096 秒)
2021年4月,浙江大学物理系博士后Yuki Minami和他的合作者在Physical Review Letters上发表了两篇关于非平衡体系的新现象的论文.自然界呈现出各种类型的长程有序态,如晶体固体、液晶、铁磁体和玻色-爱因斯坦凝聚物。虽然长程有序态在三维世界中无处不在,但那些与连续对称性破坏相关的长程有序态在二维平衡体系中却被Mermin-Wagner定理所禁止。
Assessment of seminal oxidative stress indicators is emerging as a valuable prognostic tool in assisted reproductive technology. We investigated levels of oxidative stress caused by reactive oxygen s...
Ancient dinosaurs were adorned in some amazing ways, from the horns of the triceratops to the plates and spikes of the stegosaurus. A newly discovered, bird-like dinosaur fossil from China contains ev...
Metalenses — flat surfaces that use nanostructures to focus light — promise to revolutionize optics by replacing the bulky, curved lenses currently used in optical devices with a simple, flat surface....
A path in an edge-colored graph is called {\em rainbow} if no two edges of it are colored the same. For an $\ell$-connected graph $G$ and an integer $k$ with $1\leq k\leq \ell$, the {\em rainbow $k$-c...
A path in an edge-colored graph is called a rainbow path if the edges on it have distinct colors. For k  1, the rainbow-k-connectivity of a graph G, denoted by rck(G), is the minimum number of colors...
This study was designed to re-evaluate the dietary methionine requirement by means of the plasma methionine and ammonia concentrations in surgically modified rainbow trout, Oncorhynchus mykiss. A tota...
A vertex-colored graph is rainbow vertex-connected if any two ver-tices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster.
For a graph G, Chartrand et al. defined the rainbow connection number rc(G)and the strong rainbow connection number src(G) in “G. Charand, G.L. John,K.A. Mckeon, P. Zhang, Rainbow connection in graphs...
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of G, denoted rc(G), is the minimum number of c...
A path in an edge-colored graph is called a rainbow path if all edges on it have pairwise distinct colors. For k ≥ 1, the rainbow-k-connectivity of a graph G, denoted rck(G), is the minimum number o...
A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. A nontrivial connected graph $G$ is rainbow connected if th...
A path in an edge-colored graph $G$, where adjacent edges may have the same color, is called a rainbow path if no two edges of the path are colored the same. The rainbow connectivity $rc(G)$ of $G$ i...
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two e...
I present an overview of the Swift mission, which was launched on November 20, 2004 to discover and observe the most energetic of astrophysical phenomena, gamma-ray bursts (GRBs).

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...