Related papers: Resolution of Indecomposable Integral Flows on Sig…
We study $2$-dimensional unit vector flows on graphs, that is, nowhere-zero flows that assign to each oriented edge a unit vector in $\mathbb R^{3}$. We give a new geometric characterization of $\mathbb S^{2}$-flows on cubic graphs. We also…
Free surface, axially symmetric shallow flow is analysed in both the centrifugal and centripetal directions. Referring to the inviscid steady flow over a flat plate characterised by a unique value of specific energy, the analytical sub- and…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…
This paper introduces a notion of decompositions of integral varifolds into countably many integral varifolds, and the existence of such decomposition of integral varifolds whose first variation is representable by integration is…
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
We generalize the notion of an inverse sequence of graph covers from the zero-dimensional dynamical systems to any dynamical system.
Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph decomposes into a unique number of cycles if and only if it does not contain two…
We initiate the study of nowhere-zero flow reconfiguration. The natural question is whether any two nowhere-zero $k$-flows of a given graph $G$ are connected by a sequence of nowhere-zero $k$-flows of $G$, such that any two consecutive…
Given two graphs G and H, there is a bi-resolving (or bi-covering) graph homomorphism from G to H if and only if their adjacency matrices satisfy certain matrix relations. We investigate the bi-covering extensions of bi-resolving…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We consider the class of integer rectifiable currents without boundary satisfying a positivity condition. We establish that these currents can be written as a linear superposition of graphs of finitely many functions with bounded variation.
We study solutions of the generalized porous medium equation on infinite graphs. For nonnegative or nonpositive integrable data, we prove the existence and uniqueness of mild solutions on any graph. For changing sign integrable data, we…
We show that the complete graph on $n$ vertices can be decomposed into $t$ cycles of specified lengths $m_1,\ldots,m_t$ if and only if $n$ is odd, $3\leq m_i\leq n$ for $i=1,\ldots,t$, and $m_1+\cdots+m_t=\binom n2$. We also show that the…
We identify a set of quantum graphs with unique and precisely defined spectral properties called {\it regular quantum graphs}. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are…
The automorphisms of a graph act naturally on its set of labeled imbeddings to produce its unlabeled imbeddings. The imbedding sum of a graph is a polynomial that contains useful information about a graph's labeled and unlabeled imbeddings.…
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…
Recent advances in dynamic graph processing have enabled the analysis of highly dynamic graphs with change at rates as high as millions of edge changes per second. Solutions in this domain, however, have been demonstrated only for…
We consider magnetic flows on compact quotients of the 3-dimensional solvable geometry Sol determined by the usual left-invariant metric and the distinguished monopole. We show that these flows have positive Liouville entropy and therefore…