All of Graphs of the Platonic Solids are Graceful

The term"graceful graph"was proposed by Professor S.W.Golomb in Southen Califor-nia University in 1972[1].A question arisen in reference [1] is answered in this article. Let G be a simple graph of γ vertices and εedges.G is graceful if there is a labelling l ofits vertices with distinct integers from the set{0,1,…,ε},so that the induced edge labellingl’defined by     

部分相干场的计算

本文描述:应用归化点扩散函数来计算最佳焦点处的Strehl强度及应用部分相干光成象理论来计算不透明直边和一对直线的亮度分布.结论是部分相干光象的极限分辨率是相干度的函数(除了象差).