华东师范大学学报(自然科学版) ›› 2018, Vol. 2018 ›› Issue (2): 23-30,40.doi: 10.3969/j.issn.1000-5641.2018.02.003

• 数学 • 上一篇    下一篇

探索Euler图的等价命题

孙慧1, 姚兵1,2   

  1. 1. 西北师范大学 数学与统计学院, 兰州 730070;
    2. 兰州交通大学 电子与信息工程学院, 兰州 730070
  • 收稿日期:2017-02-20 出版日期:2018-03-25 发布日期:2018-03-22
  • 通讯作者: 姚兵,男,教授,研究方向为图着色与标号、复杂网络及优化.E-mail:yybb918@163.com. E-mail:yybb918@163.com
  • 作者简介:孙慧,女,硕士研究生,研究方向为图着色与标号、复杂网络.E-mail:18919104606@163.com.
  • 基金资助:
    国家自然科学基金(61163054,61363060,61662066)

Exploring equivalent definitions of eulerian graphs

SUN Hui1, YAO Bing1,2   

  1. 1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China;
    2. School of Electronic and Information Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China
  • Received:2017-02-20 Online:2018-03-25 Published:2018-03-22

摘要: 从研究Euler图的等价命题入手,尝试挖掘Euler图的拓扑结构,力图从多个角度刻画Euler图的本征,得到4个新的Euler图等价命题,并利用图的"浓缩"和"稀释"运算给出刻画Euler图的技术,且此技术能够转化为可行的算法.

关键词: Euler图, 无邻顶点重合运算, 边收缩运算, 顶点剖分运算, 2-度拆分运算

Abstract: From the topic of equivalent propositions of eulerian graph to start our study, we try to dig the topology of eulerian graph, and to describe eulerian graph from the view of different insights. Finally, we obtain four new equivalent propositions of eulerian graph by the technique of "concentration" and "dilution" operations, which can be transformed into two feasible algorithms.

Key words: eulerian graph, non-adjacent identifying operation, edge contraction operation, vertex subdivision operation, 2-degree split operation

中图分类号: