Related papers: On the orientation of graphs

An edge uv in a graph \Gamma\ is directionally 2-signed (or, (2,d)-signed) by an ordered pair (a,b), a,b in {+,-}, if the label l(uv) = (a,b) from u to v, and l(vu) = (b,a) from v to u. Directionally 2-signed graphs are equivalent to…

For any graph $G=(V,E)$, a subset $S\subseteq V$ \emph{dominates} $G$ if all vertices are contained in the closed neighborhood of $S$, that is $N[S]=V$. The minimum cardinality over all such $S$ is called the domination number, written…

In this paper, we define vertex algebras and vertex coalgebras in the category of rational $G_\Gamma$-modules, where $G_\Gamma$ is the group scheme defined by the group algebra $\mathsf k \Gamma$ for an abelian group $\Gamma$. In this…

Let $\Gamma$ be a finite d-valent graph and G an n-dimensional torus. An ``action'' of G on $\Gamma$ is defined by a map, $\alpha$, which assigns to each oriented edge e of $\Gamma$ a one-dimensional representation of G (or, alternatively,…

We study the (virtual) indicability of the automorphism group $Aut(A_\Gamma)$ of the right-angled Artin group $A_\Gamma$ associated to a simplicial graph $\Gamma$. First, we identify two conditions -- denoted (B1) and (B2) -- on $\Gamma$…

A Hamilton cycle in a graph $\Gamma$ is a cycle passing through every vertex of $\Gamma$. A Hamiltonian decomposition of $\Gamma$ is a partition of its edge set into disjoint Hamilton cycles. One of the oldest results in graph theory is…

In this paper we show how some known weak forms of the Zilber--Pink conjecture can be strengthened by combining them with the Mordell--Lang conjecture or its variants. We illustrate this idea by proving some theorems on atypical…

In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…

Given a graph $\Gamma$, one may conside the set $X$ of its vertices as a metric space by assuming that all edges have length one. We consider two versions of homology theory of $\Gamma$ and their $K$-theory counterparts -- the $K$-theory of…

We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and $2-$structures. We show that, under some axioms, a unique decomposition…

A graph $\Gamma$ is said to be universal for a class of graphs $\mathcal{H}$ if $\Gamma$ contains a copy of every $H \in \mathcal{H}$ as a subgraph. The number of edges required for a host graph $\Gamma$ to be universal for the class of…

The aim of this paper is to introduce and study graded and filtered gamma rings and gamma modules. We prove that the filtered $\Gamma$-ring (module) is a generalization of the notion of graded ring (module). Also, we construct a graded…

Using the stratifications of Deligne-Mumford moduli spaces $\overline{\mathcal M}_{g,n}$ indexed by stable graphs, we introduce a partially ordered set of stable graphs by defining a partial ordering on the set of connected stable graphs of…

We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…

An analysis of the zeta and gamma function is presented, using elementary functions like [] and {}, a general formula for the angle of zeta(1/2 + i*n) is found and the same for the gamma function.

In this paper, we show how to use the framework of mod-Gaussian convergence in order to study the fluctuations of certain models of random graphs, of random permutations and of random integer partitions. We prove that, in these three…

We give a necessary and sufficient graph-theoretic characterization of toric ideals of graphs that are unimodular. As a direct consequence, we provide the structure of unimodular graphs by proving that the incidence matrix of a graph $G$ is…

We prove an approximation result showing how operators of the type $-\Delta -\gamma \delta (x-\Gamma)$ in $L^2(\mathbb{R}^2)$, where $\Gamma$ is a graph, can be modeled in the strong resolvent sense by point-interaction Hamiltonians with an…

Let $\Lambda$ be a radical square zero Nakayama algebra with $n$ simple modules and let $\Gamma$ be the Auslander algebra of $\Lambda$. Then every indecomposable direct summand of a tilting $\Gamma$-module is either simple or projective.…

Modular symbols for the congruence subgroup $\Gamma_0(\mathfrak{n})$ of $GL_{2}(\mathbf{F}_q[T])$ have been defined by Teitelbaum. They have a presentation given by a finite number of generators and relations, in a formalism similar to…