欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
已知图可以作为无标度网络研究的模型，如小世界网络、层次网络和自相似网络等。研究了树的可拆分和重新组合下的边魔幻全标号性。总可以连接集有序优美树T的某一对不相邻顶点，然后删去一个圈上的一条边，得到一棵具有边魔幻全标号的树。进一步，对满足｜T｜＜｜M｜的树M和树T进行拆分和重新组合，进行有限次减圈运算后，得到具有超级边魔幻全标号树。
英文摘要：
It has been known that graphs can be used as models in researching scale-free networks, such as hierarchial-networks and self-similar networks and so on.We study theedge-magic total labellings on splitting and recombining trees.We can adjoin a pair of non-adjacent vertices of a tree having set-ordered graceful labellings to obtain a new graph, then delete another edge on a cycle of the new graph to form a tree having edge-magic total labellings.And we split a tree M intopieces, and then assemble them on another tree T with ｜T｜＆lt;｜M｜to result a new graph G.After a se-ries of the reducing cycle operations on G, we obtain a tree that admits edge-magic total labellings.
同期刊论文项目
同项目期刊论文
期刊信息
位置：