In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...

in this paper we define the removable cycle that, if $im$ is a class of graphs, $gin im$, the cycle $c$ in $g$ is called removable if $g-e(c)in im$. the removable cycles in eulerian graphs have been studied. we characterize eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles h...

in this paper, a cfd model of syngas flow in slurry bubble column was developed. the model is based on an eulerian-eulerian approach and includes three phases: slurry of solid particles suspended in paraffin oil and syngas bubbles. numerical calculations carried out for catalyst particles, bubble coalescence and breakup included bubble-fluid drag force and interfacial area effects. also, the ef...

In this paper, a CFD model of syngas flow in slurry bubble column was developed. The model is based on an Eulerian-Eulerian approach and includes three phases: slurry of solid particles suspended in paraffin oil and syngas bubbles. Numerical calculations carried out for catalyst particles, bubble coalescence and breakup included bubble-fluid drag force and interfacial area effects. Also, the ef...

Subcooled flow boiling in multi-microchannels can be used as an efficient thermal management approach in compact electrical devices. Highly subcooled flow boiling of HFE 7100 is studied in two microchannel heat sinks to choose a proper numerical model for simulating boiling flows in microchannels. Results of five different numerical models, including Volume of Fluid (VOF), Eulerian boiling, Eul...

A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circuit. A graph is Eulerian if it contains an Eulerian circuit. It is well known that a connected graph G is Eulerian if and only if every vertex of G is even. An Eulerian walk in a connected graph G is a closed walk that contains every edge of G at least once, while an irregular Eulerian walk in G i...

A straight ahead walk in an embedded Eulerian graph G always passes from an edge to the opposite edge in the rotation at the same vertex A straight ahead walk is called Eulerian if all the edges of the embedded graph G are traversed in this way starting from an arbitrary edge An embedding that contains an Eulerian straight ahead walk is called an Eulerian embedding In this article we characteri...