Results 21 to 30 of about 17,014 (265)
Flows on graphs with random capacities [PDF]
Physical Review E, 2006 We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold that depends on the distribution of capacities.
Antal, T., Krapivsky, P. L.
openaire +3 more sources
European Journal of Combinatorics, 2022 A bridgeless graph $G$ is called $3$-flow-critical if it does not admit a nowhere-zero $3$-flow, but $G/e$ has for any $e\in E(G)$. Tutte's $3$-flow conjecture can be equivalently stated as that every $3$-flow-critical graph contains a vertex of degree three. In this paper, we study the structure and extreme edge density of $3$-flow-critical graphs. We
Jiaao Li +4 more
openaire +2 more sources
Measurements of 2-D flow parameters around rectangular prisms arranged at the ground
Budownictwo i Architektura, 2008 Measurements of 2-D flows around a square and a rectangle (ratio 2:1) in wind tunnel have been presented in this paper. The results of these measurements presented here are pressure and standard deviation distributions on the models’ walls, components of
Ewa Błazik-Borowa +4 more
doaj +1 more source
Flow generated by slow steady rotation of a permeable sphere in a micro-polar fluid
Alexandria Engineering Journal, 2017 The analytical study of the flow generated by the slow steady rotation of a permeable sphere in an incompressible micro-polar fluid is considered. Both the flows internal and external to the sphere are coupled.
P. Aparna +3 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2008 Abstract In this paper we introduce the concept of k-flow-critical graphs. These are graphs that do not admit a k-flow but such that any smaller graph obtained from it by contraction of edges or of pairs of vertices is k-flowable. Any minimal counter-example for Tutte's 3-Flow and 5-Flow Conjectures must be 3-flow-critical and 5-flow-critical ...
Cândida Nunes da Silva +1 more
openaire +1 more source
CoRR, 2019 We introduce graph normalizing flows: a new, reversible graph neural network model for prediction and generation. On supervised tasks, graph normalizing flows perform similarly to message passing neural networks, but at a significantly reduced memory footprint, allowing them to scale to larger graphs.
Jenny Liu +4 more
openaire +3 more sources
Flow polynomials of a Signed Graph [PDF]
The Electronic Journal of Combinatorics, 2019 For a signed graph $G$ and non-negative integer $d$, it was shown by DeVos et al. that there exists a polynomial $F_d(G,x)$ such that the number of the nowhere-zero $\Gamma$-flows in $G$ equals $F_d(G,x)$ evaluated at $k$ for every Abelian group $\Gamma$ of order $k$ with $\epsilon(\Gamma)=d$, where $\epsilon(\Gamma)$ is the largest integer $d$ for ...
Xiangyu Ren, Jianguo Qian
openaire +3 more sources
Algorithms, 2014 We describe a flow model related to ordinary network flows the same way as stable matchings are related to maximum matchings in bipartite graphs. We prove that there always exists a stable flow and generalize the lattice structure of stable marriages to ...
Tamás Fleiner
doaj +1 more source
Structure of laminar flows with oppositely-rotating coaxial layers
MATEC Web of Conferences, 2018 The article is devoted to the theoretical study of laminar flows with the coaxial layers rotating in opposite directions moving along the pipe. These flows have a wide practical application potential in technologies of mixing multiphase and heterogeneous
Zuikov Andrey +2 more
doaj +1 more source
Testing the oil flow parameters of CLAAS ARION 610 tractor pump
Pojazdy Szynowe, 2020 The article presents the results of comparative tests of partial pump flows with capacity of 110 l/min and 150 l/min. The oil demand for servicing the internal devices of the CLAAS ARION 610 agricultural tractor was measured.
Emil Kaźmierczak
doaj +1 more source