【24h】

On Super Edge-graceful Eulerian Graphs

机译:在超级优雅的欧拉图上

获取原文

摘要

Let G be a (p,q) graph in which the edges are labeled 1,2,3,...q so that the vertex sums are distinct, mod p, then G is called edge-graceful. J. Mitchem and A. Simoson introduced the concept of super edge-graceful graphs which is a stronger concept than edge-graceful for some classes of graphs. We show here some eulerian graphs are super edge-graceful, but not edge-graceful; and some are edge-graceful but not super edge-graceful. We show that Rosa's type condition for eulerian super edge-graceful graphs does not exist. Moreover, some conjectures are proposed.
机译:设g是一个(p,q)图,其中边缘被标记为1,2,3,... q,使得顶点总和是不同的,mod p,然后g称为边缘优雅。 J. Mitchem和A. Simoson介绍了超优选的图表的概念,这是一个更强大的概念,而不是边缘优雅为某些阶段的图表。我们在这里展示一些欧拉图是超级优雅的,但不是优雅的;有些是优雅,但不是超级优雅。我们显示ROSA的欧拉超级优化图形的类型条件不存在。而且,提出了一些猜想。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号