期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
图全染色的几个定理 被引量:1
1
作者 李晓东 《哈尔滨理工大学学报》 CAS 2001年第1期100-102,106,共4页
图的全染色是染色理论的重要内容,全染色猜想:设G是一个简单图,则XT(G)≤△(G)+2是一个至今未解决的问题.证明了对于一些图类全染色猜想是正确的.
关键词 全染色 HAMILTON 无环 重边图
下载PDF
完全图K_n的8长圈最小覆盖设计
2
作者 李明超 霍京京 《山东理工大学学报(自然科学版)》 CAS 2009年第2期27-29,共3页
首先对所需要的小阶数w构作其最小覆盖设计,然后应用递归构造给出了任意v≡w(mod 16)的最小覆盖设计,从而证明了对任意正整数v完全图Kv的8长圈最小覆盖设计的存在性.
关键词 覆盖设计 带洞设计 重边图
下载PDF
Automatic Damage Detection of Engineering Ceramics Ground Surface Based on Texture Analysis 被引量:2
3
作者 林滨 陈善功 +1 位作者 韩雪松 梁小虎 《Transactions of Tianjin University》 EI CAS 2013年第4期267-271,共5页
Ground textures seriously interfere with the exact identification of grinding damage. The common nondestructive testing techniques for engineering ceramics are limited by their difficulty and cost. Therefore, this pap... Ground textures seriously interfere with the exact identification of grinding damage. The common nondestructive testing techniques for engineering ceramics are limited by their difficulty and cost. Therefore, this paper proposes a global image reconstruction scheme in ground texture surface using Fourier transform (FT). The lines associated with high-energy frequency components in the spectrum that represent ground texture information can be detected by Hough transform (HT), and the corresponding high-energy frequency components are set to zero. Then the spectrum image is back-transformed into the spatial domain image with inverse Fourier transform (IFT). In the reconstructed image, the main ground texture information has been removed, whereas the surface defects information is preserved. Finally, Canny edge detection is used to extract damage image in the reconstructed image. The experimental results of damage detection for the ground texture surfaces of engineering ceramics have shown that the proposed method is effective. 展开更多
关键词 engineering ceramics damage detection ground texture Fourier transform
下载PDF
Adjacent Strong Edge Chromatic Number of Series-Parallel Graphs 被引量:1
4
作者 王淑栋 庞善臣 许进 《Journal of Mathematical Research and Exposition》 CSCD 北大核心 2005年第2期267-278,共12页
In this paper, we will study the adjacent strong edge coloring of series-parallel graphs, and prove that series-parallel graphs of △(G) = 3 and 4 satisfy the conjecture of adjacent strong edge coloring using the doub... In this paper, we will study the adjacent strong edge coloring of series-parallel graphs, and prove that series-parallel graphs of △(G) = 3 and 4 satisfy the conjecture of adjacent strong edge coloring using the double inductions and the method of exchanging colors from the aspect of configuration property. For series-parallel graphs of △(G) ≥ 5, △(G) ≤ x'as(G) ≤ △(G) + 1. Moreover, x'as(G) = △(G) + 1 if and only if it has two adjacent vertices of maximum degree, where △(G) and X'as(G) denote the maximum degree and the adjacent strong edge chromatic number of graph G respectively. 展开更多
关键词 series-parallel graph adjacent strong edge coloring adjacent strong edge chromatic number.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部