On the Gracefulness of the Digraphs n·Cm* |
| |
作者姓名: | Jirimutu Jun Wang Xu Xirong |
| |
作者单位: | [1]College of Mathematics, Inner Mongolian University for Nationalities, Tongliao 028043, China [2]Department of Mathematics, DaIian University of Technology, Dalian 116024, China [3]Department of Computer Science, Dalian University of Technology, Dalian 116024, China |
| |
基金项目: | This project is supported by Inner Mongolia University for Nationalities fund(N J040669) |
| |
摘 要: | 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
|
关 键 词: | 优美标号 有向图 电子 导函数 优美性 诱导力 双射 |
本文献已被 维普 等数据库收录! |
|