Related papers: Nowhere-zero flows on signed eulerian graphs
We show that in any graph, the average length of a flow path in an electrical flow between the endpoints of a random edge is $O(\log^2 n)$. This is a consequence of a more general result which shows that the spectral norm of the entrywise…
Euler graphs with only one (two) type(s) of cycles under (mod 4) operation were studied in Part-I(II). Here we consider the class of Euler graphs with only three types of cycles under (mod 4). This gives rise to four cases viz., graphs…
Given a finite directed acyclic graph, the space of non-negative unit flows is a lattice polytope called the flow polytope of the graph. We consider the volumes of flow polytopes for directed acyclic graphs on $n+1$ vertices with a fixed…
We consider (smooth) solutions of the mean curvature flow of graphs over bounded domains in a Lie group free up to step two (and not necessarily nilpotent), endowed with a one parameter family of Riemannian metrics $\sigma_\e$ collapsing to…
A rich $k$-flow is a nowhere-zero $k$-flow $\phi$ such that, for every pair of adjacent edges $e$ and $f$, $|\phi(e)| \neq |\phi(f)|$. A graph is rich flow admissible if it admits a rich $k$-flow for some integer $k$. In this paper, we…
A Newton graph of order $r( \geqslant 2)$ is a cellularly embedded toroidal graph on $r$ vertices, $2r$ edges and $r$ faces that fulfils certain combinatorial properties (Euler, Hall). The significance of these graphs relies on their role…
Given a $2$-$(v,k,\lambda)$ design, $\cal{S}=(X,\cal{B})$, a {\it zero-sum $n$-flow} of $\cal{S}$ is a map $f: \cal{B} \longrightarrow \{\pm 1, \ldots ,\pm (n-1)\}$ such that for any point $x\in X$, the sum of $f$ around all the blocks…
This paper investigates the dynamics of time-periodic Euler flows in multi-connected, planar fluid regions which are ``stirred'' by the moving boundaries. The classical Helmholtz theorem on the transport of vorticity implies that if the…
In this paper, we consider the steady irrotational Euler flows in multidimensional nozzles. The first rigorous proof on the existence and uniqueness of the incompressible flow is provided. Then, we justify the corresponding low Mach number…
A little complement concerning the dynamics of non-metric manifolds is provided, by showing that any flow on an $\omega$-bounded surface with non-zero Euler character has a fixed point.
A graph (digraph) $G=(V,E)$ with a set $T\subseteq V$ of terminals is called inner Eulerian if each nonterminal node $v$ has even degree (resp. the numbers of edges entering and leaving $v$ are equal). Cherkassky and Lov\'asz showed that…
This paper develops the geometry and analysis of the averaged Euler equations for ideal incompressible flow in domains in Euclidean space and on Riemannian manifolds, possibly with boundary. The averaged Euler equations involve a parameter…
It is well known that \textit{every} Eulerian orientation of an Eulerian $2k$-edge connected (undirected) graph is strongly $k$-edge connected. An important goal in the area is to obtain analogous results for other types of connectivity,…
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some…
The nullity of a graph is the multiplicity of the eigenvalues zero in its spectrum. A signed graph is a graph with a sign attached to each of its edges. In this paper, we obtain the coefficient theorem of the characteristic polynomial of a…
We consider ($-\alpha$)-homogeneous solutions to the stationary incompressible Euler equations in $\mathbb{R}^{3}\backslash\{0\}$ for $\alpha\geq 0$ and in $\mathbb{R}^{3}$ for $\alpha<0$. Shvydkoy (2018) demonstrated the nonexistence of…
An elliptic Newton flow is a dynamical system that can be interpreted as a continuous version of Newton's iteration method for finding the zeros of an elliptic function f. Previous work focusses on structurally stable flows (i.e., the phase…
In this paper the concept of circular $r$-flows in a mono-directed signed graph $(G, \sigma)$ is introduced. That is a pair $(D, f)$, where $D$ is an orientation on $G$ and $f: E(G)\to (-r,r)$ satisfies that $|f(e)|\in [1, r-1]$ for each…
This paper proves that for any positive integer $k$, every essentially $(2k+1)$-unbalanced $(12k-1)$-edge connected signed graph has circular flow number at most $2+\frac 1k$.
We propose a Law of Nature? Viz., Pure Regularity Occurs at Na\"ive Levels and Regularity has Affinity with Evenness. In a series of three papers, it was established that regular Euler graphs with only one type of (pure) cycles are…