Journal of East China Normal University(Natural Sc ›› 2018, Vol. 2018 ›› Issue (2): 23-30,40.doi: 10.3969/j.issn.1000-5641.2018.02.003

Previous Articles     Next Articles

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

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

CLC Number: