Results 11 to 20 of about 24,440 (246)

Term Graph Rewriting and Parallel Term Rewriting [PDF]

Electronic Proceedings in Theoretical Computer Science, 2011
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing.
Andrea Corradini, Frank Drewes
doaj   +1 more source

Distinguishing Infinite Graphs [PDF]

The Electronic Journal of Combinatorics, 2007
The distinguishing number $D(G)$ of a graph $G$ is the least cardinal number $\aleph$ such that $G$ has a labeling with $\aleph$ labels that is only preserved by the trivial automorphism. We show that the distinguishing number of the countable random graph is two, that tree-like graphs with not more than continuum many vertices have distinguishing ...
Imrich, Wilfried, Klavžar, Sandi, Trofimov, Vladimir   +2 more
openaire   +2 more sources

Graphoidally independent infinite graphs

AKCE International Journal of Graphs and Combinatorics, 2021
A graphoidal cover of a graph G (not necessarily finite) is a collection ψ of paths in G, called ψ-edges, (not necessarily finite, not necessarily open) satisfying the following axioms: (GC-1) Every vertex of G is an internal vertex of at most one path ...
Purnima Gupta, Deepti Jain
doaj   +1 more source

Helmholtz operators on infinite graphs

Heliyon
The Helmholtz equation in its simplest form is Δu(a)=−k2u(a). In this note, we study a generalized discrete version of this equation on an infinite graph, by using potential-theoretic methods.
Varadha Raj Manivannan, Madhu Venkataraman   +1 more
doaj   +3 more sources

Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems [PDF]

Electronic Proceedings in Theoretical Computer Science, 2015
The general form of safe recursion (or ramified recurrence) can be expressed by an infinite graph rewrite system including unfolding graph rewrite rules introduced by Dal Lago, Martini and Zorzi, in which the size of every normal form by innermost ...
Naohi Eguchi
doaj   +1 more source

Approximations of Acyclic Graphs

Известия Иркутского государственного университета: Серия "Математика", 2022
In this paper, approximations of acyclic graphs are studied. It is proved that any theory of an acyclic graph (tree) of finite diameter is pseudofinite with respect to acyclic graphs (trees), that is, any such theory is approximated by theories of finite
N.D. Markhabatov
doaj   +1 more source

Uniform graph embedding into metric spaces [PDF]

Компьютерные исследования и моделирование, 2012
The task of embedding an infinity countable graph into continuous metric space is considered. The concept of uniform embedding having no accumulation point in a set of vertex images and having all graph edge images of a limited length is introduced ...
A. V. Koganov
doaj   +1 more source

Controlled information transfer in continuous-time chiral quantum walks

New Journal of Physics, 2021
In this paper we investigate properties of continuous time chiral quantum walks, which possess complex valued edge weights in the underlying graph structure, together with an initial Gaussian wavefunction spread over a number of vertices.
A Khalique, A Sett, J B Wang, J Twamley
doaj   +1 more source

Unfolding of Finite Concurrent Automata [PDF]

Electronic Proceedings in Theoretical Computer Science, 2018
We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj   +1 more source

On Transmission Irregular Cubic Graphs of an Arbitrary Order

Mathematics, 2022
The transmission of a vertex v of a graph G is the sum of distances from v to all the other vertices of G. A transmission irregular graph (TI graph) has mutually distinct vertex transmissions.
Anatoly Yu. Bezhaev, Andrey A. Dobrynin
doaj   +1 more source