Results 11 to 20 of about 382,145 (280)
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 +4 more sources
The Dynamics of the Forest Graph Operator
Discussiones Mathematicae Graph Theory, 2016 In 1966, Cummins introduced the “tree graph”: the tree graph T(G) of a graph G (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge, i.e., two spanning trees ...
Dara Suresh +4 more
doaj +2 more sources
Extremal infinite graph theory
Discrete Mathematics, 2011 We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.
Maya Stein
exaly +5 more sources
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
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
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 ...
Wilfried Imrich +2 more
openaire +2 more sources
The Rigidity of Infinite Graphs [PDF]
Discrete & Computational Geometry, 2018 A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 12 a countable graph which is rigid for generic placements in R^d may fail the stronger property of sequential rigidity, while for d=2 the equivalence with sequential rigidity ...
Derek Kitson, Stephen C. Power
openaire +3 more sources
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
Duality in Infinite Graphs [PDF]
Combinatorics, Probability and Computing, 2006 The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstructions fall away when duality is reinterpreted on the basis of a ‘singular’ approach to graph homology, whose cycles are defined topologically in a space formed by the graph ...
Henning Bruhn, Reinhard Diestel
openaire +1 more source