Related papers: Loop conditions with strongly connected graphs
We prove that if A is a finite algebra with a parallelogram term that satisfies the split centralizer condition, then A is dualizable. This yields yet another proof of the dualizability of any finite algebra with a near unanimity term, but…
In case the stability relation is a congruence, a necessary and also a sufficient condition for its equality with the center congruence is given.
A word-graph Gw is a digraph represented by a word w such that the vertex-set V(Gw) is the alphabet of w and the edge-set E(Gw) is determined by non-identical adjacent letter pairs in w. In this paper we study the strong-connectivity of…
In this survey we overview known results on the strong subgraph $k$-connectivity and strong subgraph $k$-arc-connectivity of digraphs. After an introductory section, the paper is divided into four sections: basic results, algorithms and…
In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
Let $t$ be a positive real number. A graph is called $t$-tough if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components. The toughness of a graph is the largest $t$ for which the graph is $t$-tough.…
This note describes necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a connected simple graph. Conditions are also given under which a sequence is necessarily connected i.e. the sequence…
We give a sufficient condition for isometric actions to have the congruency of orbits, that is, all orbits are isometrically congruent to each other. As applications, we give simple and unified proofs for some known congruence results, and…
A (t,s)-rack is a rack structure defined on a module over the ring $\ddot\Lambda=\mathbb{Z}[t^{\pm 1},s]/(s^2-(1-t)s)$. We identify necessary and sufficient conditions for two $(t,s)$-racks to be isomorphic. We define enhancements of the…
We prove that in a random tournament the events $\{s\rightarrow a\}$ and $\{t\rightarrow b\}$ are positively correlated, for distinct vertices $a,s,b,t \in K_n.$ It is also proven that the correlation between the events $\{s\rightarrow a\}$…
For a continuous map on a topological graph containing a unique loop S, it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…
We consider directed graphs E which have been obtained by adding a sink to a fixed graph G. We associate an element of Ext(C*(G)) to each such E, and show that the classes of two such graphs are equal in Ext(C*(G)) if and only if the…
For a continuous map on a topological graph containing a unique loop S it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…
Let E be an arbitrary directed graph and let K be any field. It is shown that the Leavitt path algebra A of the graph E over the field K is a Zorn ring if and only if the graph E satisfies the Condition (L), that is, every cycle in E has an…
It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph. We present a variant of this construction and show that…
This article introduces strongly proximal continuous (s.p.c.) functions, strong proximal equivalence (s.p.e.) and strong connectedness. A main result is that if topological spaces $X,Y$ are endowed with compatible strong proximities and…
We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…
To any differential system $d\Psi=\Phi\Psi$ where $\Psi$ belongs to a Lie group (a fiber of a principal bundle) and $\Phi$ is a Lie algebra $\mathfrak g$ valued 1-form on a Riemann surface $\Sigma$, is associated an infinite sequence of…
Let $t\geqslant 2$ and $s\geqslant 1$ be two integers. Define a $(t,s)$-coloring of a hypergraph to be a coloring of its vertices using $t$ colors such that each color appears on each edge at least $s$ times. In this note, we provide a…
A digraph $\mathbb G$ is called weakly connected, strongly connected, and extremely connected if any two vertices of $\mathbb G$ are connected respectively by an oriented, a directed, and a symmetric path in $\mathbb G$. We investigate the…