Results 21 to 30 of about 886,685 (323)
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
Complexity, 2021 A connected graph is called Hamilton-connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton-connected is an NP-complete problem.
Sakander Hayat +3 more
doaj +1 more source
Infinite limits and folding [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic
Anthony Bonato, Jeannette Janssen
doaj +1 more source
On the Metric Dimension of Infinite Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this paper we study the metric dimension of infinite graphs such that all its vertices have finite degree.
José Cáceres +4 more
openaire +5 more sources
Non symmetric random walk on infinite graph [PDF]
Opuscula Mathematica, 2011 We investigate properties of a non symmetric Markov's chain on an infinite graph. We show the connection with matrix valued random walk polynomials which satisfy the orthogonality formula with respect to non a symmetric matrix valued measure.
Marcin J. Zygmunt
doaj +1 more source
Linearly bounded infinite graphs [PDF]
Acta Informatica, 2005 Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of
Carayol, Arnaud, Meyer, Antoine
openaire +7 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 +1 more source
INCOMPLETE MARKETS IN INFINITE HORIZON: DEBT CONSTRAINTS VERSUS NODE PRICES [PDF]
, 1995 The general equilibrium model with incomplete markets is here extended to infinite horizon economies populated by a finite number of infinitely lived agents.
Monique Florenzano +3 more
core +2 more sources
Unavoidable topological minors of infinite graphs [PDF]
, 2010 This is the post-print version of the Article - Copyright @ 2010 ElsevierA graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite ...
Ding, Guoli +5 more
core +1 more source
Sobolev Regularity of Multilinear Fractional Maximal Operators on Infinite Connected Graphs
Mathematics, 2021 Let G be an infinite connected graph. We introduce two kinds of multilinear fractional maximal operators on G. By assuming that the graph G satisfies certain geometric conditions, we establish the bounds for the above operators on the endpoint Sobolev ...
Suying Liu, Feng Liu
doaj +1 more source
Directed graph iterated function systems [PDF]
, 2011 This thesis concerns an active research area within fractal geometry. In the first part, in Chapters 2 and 3, for directed graph iterated function systems (IFSs) defined on ℝ, we prove that a class of 2-vertex directed graph IFSs have attractors that ...
Boore, Graeme C.
core +2 more sources