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 γ vertice...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展开更多
The principal components analysis (PCA) in pattern recognition is first used to discriminate the primitive sample data from hydrogeology exploration, which can be
文摘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
文摘The principal components analysis (PCA) in pattern recognition is first used to discriminate the primitive sample data from hydrogeology exploration, which can be
