Related papers: Poincare Hopf for vector fields on graphs
The Wiener index of a connected graph is the sum of the distance of all pairs of distinct vertices. It was introduced by Wiener in 1947 to analyze some aspects of branching by fitting experimental data for several properties of alkane…
The dynamics of large complex systems are predominately modeled through pairwise interactions, the principle underlying structure being a network of the form of a digraph or quiver. Significant success has been obtained in applying the…
We define Poincar\'{e} profiles of Dirichlet type for graphs of bounded degree, in analogy with the Poincar\'{e} profiles (of Neumann type) defined in [HMT19]. The obvious first definition yields nothing of interest, but an alternative…
Graphs are widely used to represent complex information and signal domains with irregular support. Typically, the underlying graph topology is unknown and must be estimated from the available data. Common approaches assume pairwise node…
Given any simple biorientable graph it is shown that there exists a weak {*}-Hopf algebra constructed on the vector space of graded endomorphisms of essential paths on the graph. This construction is based on a direct sum decomposition of…
A directed hypergraph (dihypergraph) consists of a set of vertices and a set of hyperarcs, where each hyperarc is partitioned into a head and a tail. Directed hypergraphs are useful in many applications, including the study of chemical…
We describe the topology of a general polynomial mapping $F=(f, g):X\to\Bbb C^2$, where $X$ is a complex plane or a complex sphere.
The Mayer-Vietoris theorem is known for its wide applications, especially in determining homology. In fact, this theorem provides us with a long exact sequence, where the underlying homology groups fit in. However, this theorem does not…
Suppose G is an n-vertex simple graph with vertex set {v1,..., vn} and d(i), i = 1,..., n, is the degree of vertex vi in G. The ISI matrix S(G) = [sij] of G is a square matrix of order n and is defined by sij = d(i)d(j)/d(i)+d(j) if the…
The Poincare function is a compact form of counting moduli in local geometric problems. We discuss its property in relation to V.Arnold's conjecture, and derive this conjecture in the case when the pseudogroup acts algebraically and…
In this paper, we extend the definition of cohomology associated to monotone graph properties, to encompass twisted functor coefficients. We introduce oriented matchings on graphs, and focus on their (twisted) cohomology groups. We…
We show that if a graph $G$ involves a certain square grid graph as a full subgraph, then a certain operation on it yields a simplicial suspension of the independence complex of $G$. This generalizes a result of Csorba. As a corollary, we…
A linear or multi-linear valuation on a finite abstract simplicial complex can be expressed as an analytic index dim(ker(D)) -dim(ker(D^*)) of a differential complex D:E -> F. In the discrete, a complex D can be called elliptic if a…
The Hopf theorem states that homotopy classes of continuous maps from a closed connected oriented smooth $n$-manifold $M$ to the $n$-sphere are classified by their degree. Such a map is equivalent to a section of the trivial $n$-sphere…
While Euler characteristic X(G)=sum_x w(x) super counts simplices, Wu characteristics w_k(G) = sum_(x_1,x_2,...,x_k) w(x_1)...w(x_k) super counts simultaneously pairwise interacting k-tuples of simplices in a finite abstract simplicial…
For $r\geq 1$, the $r$-independence complex of a graph $G$ is a simplicial complex whose faces are subset $I \subseteq V(G)$ such that each component of the induced subgraph $G[I]$ has at most $r$ vertices. In this article, we determine the…
A finite abstract simplicial complex G defines the Barycentric refinement graph phi(G) = (G,{ (a,b), a subset b or b subset a }) and the connection graph psi(G) = (G,{ (a,b), a intersected with b not empty }). We note here that both…
We prove that each superinjective simplicial map of the complex of curves of a compact, connected, nonorientable surface is induced by a homeomorphism of the surface, if $(g, n) \in \{(1, 0), (1, 1), (2, 0), (2, 1), (3, 0)\}$ or $g + n \geq…
Let $G=(V,E)$ be a finite simple graph. The Sombor index $SO(G)$ of $G$ is defined as $\sum_{uv\in E(G)}\sqrt{d_u^2+d_v^2}$, where $d_u$ is the degree of vertex $u$ in $G$. Let $G$ be a connected graph constructed from pairwise disjoint…
The combinatorial Hopf algebra on building sets $BSet$ extends the chromatic Hopf algebra of simple graphs. The image of a building set under canonical morphism to quasi-symmetric functions is the chromatic symmetric function of the…