云南高校图书馆联盟文献共享服务平台- CHROMATIC

CHROMATIC: 作品数：111被引量：447H指数：9; 导出分析报告; 相关领域：理学机械工程更多>>; 相关作者：方波杨星星胡腾云董威贾西贝更多>>; 相关机构：六安市人民医院宿州学院河北科技师范学院南方医科大学更多>>; 相关期刊：更多>>; 相关基金：国家自然科学基金国家重点基础研究发展计划广东省自然科学基金重庆市自然科学基金更多>>

Calculation of non-mono chromatic reflectance of Co/Sb multilayer: 《Chinese Science Bulletin》2003年第17期1899-1902,共4页FENGShimeng ZHAOHaiying SHAOJianda FANzhenxiu DOUXiaoming; Co/Sb multilayer shows the theoretical reflectance of 62% at a photoenergy of 528 eV and the grazing angle of 10.3, but the measured reflectance is very low, which is considered to result from the low energy resolutio...; 关键词：光能入射余角彩色反射率钴/锑多层膜数值计算反射谱

A note on n-edge chromatic number被引量：2: 《Chinese Science Bulletin》1997年第23期1952-1954,共3页SUN Liang and ZHANG Zhongfu1. Department of Applied Mathematics, Beijing Institute of Technology, Beijing 100081, China 2. Institute of Applied Mathematics, Lanzhou Institute of Railway, Lanzhou 730070, China; ALL graphs appearing in this note are simple. A graph with p vertices and q edges will becalled a (p, q )-graph. The maximum degree of G is denoted by Δ(G).Let n≥2 be an integer. The n-edge chromatic number X_n (G) ...; 关键词：GRAPH COMPLEMENT n-edge CHROMATIC number.

ON n-TOTAL CHROMATIC NUMBER OF A GRAPH AND ITS COMPLEMENT GRAPH: 《Chinese Science Bulletin》1991年第13期1134-1134,共1页张忠辅孙良; Project supported by the National Natural Science Foundation of China and Natural Science Fund of Gansu Province, China.; Let G(V, E) be a simple graph, f: C→V(G) be an injection, and all vertices on the path whose length is no longer than n be assigned different colors, where C is a color set. Then f is called an n-coloring of G. If |C...; 关键词：COLORING COLORS CHROMATIC VERTEX assigned LENGTH longer

THE CHROMATICITY OF THE COMPLEMENT OF THE CYCLES UNION: 《Chinese Science Bulletin》1990年第7期608-608,共1页郭知熠李永洁; The graphs considered here are finite and contain no loops nor multiple edges. Let G be such a graph, M(G; W) be its matching polynomial defined by Farrell in 1979, P(G; λ) be its chromatic polynomial. A graph G is m...; 关键词：matching polynomial CHROMATIC WHITEHEAD LETTER COMPLEMENT plies 罗理 cycle

ON CHROMATIC ENUMERATION FOR ROOTED OUTERPLANAR MAPS被引量：2: 《Chinese Science Bulletin》1989年第10期812-817,共6页刘彦佩; This research was supported by the National Natural Science Foundation of China.; On chromatic enumeration, the first paper which is for rooted planar triangulations was published in 1973. Ten years later, the author generalized the theory into that for rooted nonseparable maps. Very recently, the ...; 关键词：PLANAR MAP CHROMATIC POLYNOMIAL enumeration.

ON TOTAL COLOURING CONJECTURE: 《Chinese Science Bulletin》1988年第8期702-703,共2页王建方张忠辅; We consider the colouring of both the vertices and edges. The total chromatic number X_T(G) of a graph G is the minimum number of colours required for colouring the elements (i. e. vertices and edges) of G so that the...; 关键词：CHROMATIC CONJECTURE ASSOCIATE INCIDENT holds

CLASSIFICATION OF THE SUBSET OF PRIME NUMBERS INDUCED BY COLOURING A CLASS OF GRAPHS: 《Chinese Science Bulletin》1988年第8期703-,共1页刘儒英; Let P denote the set of all prime numbers, and D(?) P. Let G(Z, D) denote the graph with the integers as its vertex set and the edges between those pairs of integers with absolute difference in the set D. Eggleton, Er...; 关键词：INTEGERS CHROMATIC VERTEX absolute CLASS SUBSET allocate letter

KEXUE TONGBAO (SCIENCE BULLETIN) SUBJECT INDEX TO VOLUME 32 (1987): 《Chinese Science Bulletin》1987年第24期1721-1736,共16页; 关键词：刘彦佩周作领张忠辅 CHROMATIC 刘有成容华 VERTEX EXTENSION NEWMAN POLAR

A NEW METHOD TO FIND CHROMATIC POLYNOMIAL OF GRAPH AND ITS APPLICATIONS被引量：35: 《Chinese Science Bulletin》1987年第21期1508-1509,共2页刘儒英; Let G be a simple graph, and let f(G, t) be its chromatic polynomial. We; 关键词：CHROMATIC SUBGRAPH polynomial WRITE FIND SPANNING LETTER

ON CHROMATIC SUM EQUATIONS FOR ROOTED CUBIC PLANAR MAPS被引量：4: 《Chinese Science Bulletin》1987年第18期1230-1235,共6页刘彦佩; On chromatic sums, W. T. Tutte published the first paper in 1973 for rooted planar triangulations. In 1984, the author discussed the problem for more general cases of rooted nonseparable planar maps. This note provide...; 关键词：CHROMATIC planar CUBIC VERTEX satisfied proof LEMMA RESULTANT ident whenever

CHROMATIC