Circular flows of nearly Eulerian graphs and vertex-splitting

2002 ◽  
Vol 40 (3) ◽  
pp. 147-161 ◽  
Author(s):  
Cun Quan Zhang
Keyword(s):  
Eulerian Graphs ◽  
Vertex Splitting ◽  
Circular Flows

Harary index of Eulerian graphs

2021 ◽  
Author(s):  
Junqing Cai ◽  
Panpan Wang ◽  
Linlin Zhang
Keyword(s):  
Harary Index ◽  
Eulerian Graphs

Two-connected orientations of Eulerian graphs

2006 ◽  
Vol 52 (3) ◽  
pp. 230-242 ◽  
Author(s):  
Alex R. Berg ◽  
Tibor Jordán
Keyword(s):  
Eulerian Graphs

Traversing Graphs

2017 ◽  
Author(s):  
Arthur Benjamin ◽  
Gary Chartrand ◽  
Ping Zhang
Keyword(s):  
Chinese Postman Problem ◽  
Round Trip ◽  
Eulerian Graphs ◽  
Bridge Problem ◽  
Chinese Postman ◽  
Leonhard Euler ◽  
The City ◽  
East Prussia

This chapter considers Eulerian graphs, a class of graphs named for the Swiss mathematician Leonhard Euler. It begins with a discussion of the the Königsberg Bridge Problem and its connection to Euler, who presented the first solution of the problem in a 1735 paper. Euler showed that it was impossible to stroll through the city of Königsberg, the capital of German East Prussia, and cross each bridge exactly once. He also mentioned in his paper a problem whose solution uses the geometry of position to which Gottfried Leibniz had referred. The chapter concludes with another problem, the Chinese Postman Problem, which deals with minimizing the length of a round-trip that a letter carrier might take.

On Circular Flows Of Graphs

COMBINATORICA ◽  
2007 ◽  
Vol 27 (2) ◽  
pp. 245-246 ◽  
Author(s):  
Hong-Jian Lai ◽  
Rui Xu ◽  
Cun-Quan Zhang*
Keyword(s):  
Circular Flows

Study of Flow Characteristics of Oil and Water in the Process of Stirring

2013 ◽  
Vol 353-356 ◽  
pp. 3190-3193
Author(s):  
Zong Rui Hao ◽  
Juan Xu ◽  
Hai Yan Bie ◽  
Zhong Hai Zhou
Keyword(s):  
Flow Field ◽  
Flow Pattern ◽  
Cross Section ◽  
Radial Flow ◽  
Flow Characteristics ◽  
Stirred Tank ◽  
Turbulent Model ◽  
Vof Model ◽  
Circular Flows ◽  
Oil Water

To study the flow pattern in the process of oil-water stirring in three paddle stirring tank, RNG k-ε turbulent model and VOF model are adopted to simulate the flow field at different time in the stirred tank with the baffle. The results showed that, in the stirring process, inverted cone manifold was formed in the center of the stirring shaft. The stratified area was formed in the baffle and gradually transported to the bottom of the tank. The two circular flows were formed among three groups of blades. And the axially acting of the fluid was strong, which made homogeneous stirring in the stirred tank. At the same time the radial flow of the cross-section inside the tank increased because of the baffle.

scholarly journals Subsemi-Eulerian graphs

1982 ◽  
Vol 5 (3) ◽  
pp. 553-564 ◽  
Author(s):  
Charles Suffel ◽  
Ralph Tindell ◽  
Cynthia Hoffman ◽  
Manachem Mandell
Keyword(s):  
Eulerian Graphs ◽  
Related Notion ◽  
Minimum Number ◽  
Eulerian Graph

A graph is subeulerian if it is spanned by an eulerian supergraph. Boesch, Suffel and Tindell have characterized the class of subeulerian graphs and determined the minimum number of additional lines required to make a subeulerian graph eulerian.In this paper, we consider the related notion of a subsemi-eulerian graph, i.e. a graph which is spanned by a supergraph having an open trail containing all of its lines. The subsemi-eulerian graphs are characterized and formulas for the minimum number of required additional lines are given. Interrelationships between the two problems are stressed as well.

Sign in / Sign up

Export Citation Format

Share Document