Results 31 to 40 of about 25,369 (266)
Context-Sensitive Languages, Rational Graphs and Determinism [PDF]
Logical Methods in Computer Science, 2006 We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices.
Arnaud Carayol, Antoine Meyer
doaj +1 more source
A Framework for Rewriting Families of String Diagrams [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We describe a mathematical framework for equational reasoning about infinite families of string diagrams which is amenable to computer automation. The framework is based on context-free families of string diagrams which we represent using context-free ...
Vladimir Zamdzhiev
doaj +1 more source
Unicorn paths and hyperfiniteness for the mapping class group
Forum of Mathematics, Sigma, 2021 Let S be an orientable surface of finite type. Using Pho-on’s infinite unicorn paths, we prove the hyperfiniteness of orbit equivalence relations induced by the actions of the mapping class group of S on the Gromov boundaries of the arc graph and the ...
Piotr Przytycki, Marcin Sabok
doaj +1 more source
Continuous Orbit Equivalence on Self-Similar Graph Actions
Mathematics, 2019 For self-similar graph actions, we show that isomorphic inverse semigroups associated to a self-similar graph action are a complete invariant for the continuous orbit equivalence of inverse semigroup actions on infinite path spaces.
Inhyeop Yi
doaj +1 more source
Journal of Mathematics, 2021 This work deals with the well-known group-theoretic graphs called coset graphs for the modular group G and its applications. The group action of G on real quadratic fields forms infinite coset graphs. These graphs are made up of closed paths. When M acts
Hanan Alolaiyan +3 more
doaj +1 more source
On the Turán Properties of Infinite Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 Let $G^{(\infty)}$ be an infinite graph with the vertex set corresponding to the set of positive integers ${\Bbb N}$. Denote by $G^{(l)}$ a subgraph of $G^{(\infty)}$ which is spanned by the vertices $\{1,\dots,l\}$. As a possible extension of Turán's theorem to infinite graphs, in this paper we will examine how large $\liminf_{l\rightarrow \infty} {|
Andrzej Dudek, Vojtech Rödl
openaire +3 more sources
Cycle Double Covers of Infinite Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 In this paper, we study the existence of cycle double covers for infinite planar graphs. We show that every infinite locally finite bridgeless k-indivisible graph with a 2-basis admits a cycle double cover.
Javaheri Mohammad
doaj +1 more source
An advance in infinite graph models for the analysis of transportation networks
International Journal of Applied Mathematics and Computer Science, 2016 This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph.
Cera Martín, Fedriani Eugenio M.
doaj +1 more source
ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS [PDF]
Journal of Algebraic Systems, 2020 A {it local antimagic labeling} of a connected graph $G$ with at least three vertices, is a bijection $f:E(G) rightarrow {1,2,ldots , |E(G)|}$ such that for any two adjacent vertices $u$ and $v$ of $G$, the condition $omega _{f}(u) neq omega _{f}(v ...
S. Shaebani
doaj +1 more source
The center of an infinite graph
Discrete Mathematics, 1996 In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the infinite graph G if it is in the center of an increasing family of finite subgraphs covering G. We give different characterizations of when a vertex is in the center of an infinite graph and we prove that any infinite graph with at ...
Boza Prieto, Luis +2 more
openaire +4 more sources