关于t-Euler优美数对的确定

设n为正整数,φ(n)是n的Eu ler函数,对于正整数a和b,如果存在正整数t使得φ(a)=b/t,φ(b)=a/t,则称(t,a,b)是一个t-Eu ler优美数对.用初等而简洁的方法讨论了t-Eu ler优美数对的存在性,并得到了全部的t-Eu ler优美数对只有(t,a,b)=(1,1,1),(2,2α,2α)及(3,2α.3β,2α.3β),其中α,β都是正整数.

完全图的 k-优美性与优美数

在k-优美图、k-GL 矩阵(k 为非负整数)的基础上,提出优美数和子段的概念,用子段计算的方法,证得K_n(n≥5)非优美图,又证得K_n(n≥6)非1-优美图.并推出K_n的k-优美标号的性质及某些优美数.

On the Gracefulness of the Digraphs n·Cm＊

A digraph D（V, E） is said to be graceful if there exists an injection f ： V（G） →{0, 1,... , ｜E｜} such that the induced function f＇ ： E（G） --~ {1, 2,… , ｜E｜} which is defined by f＇ （u, v） = [f（v） - f（u）] （rood ｜E｜＋ 1） for every directed edge （u, v） is a bijection. Here, f is called a graceful labeling （graceful numbering） of D（V, E）, while f＇ is called the induced edge＇s graceful labeling of D. In this paper we discuss the gracefulness of the digraph n- Cm and prove that n. Cm is a graceful digraph for m = 15, 17 and even