Results 51 to 60 of about 1,525,761 (361)
(β)‐distortion of some infinite graphs [PDF]
Journal of the London Mathematical Society, 2015 A distortion lower bound of Ω(log(h)1/p) is proved for embedding the complete countably branching hyperbolic tree of height h into a Banach space admitting an equivalent norm satisfying property (β) of Rolewicz with modulus of power type p∈(1,∞) (in ...
F. Baudier, Shenmin Zhang
semanticscholar +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.
Cáceres, José +4 more
openaire +8 more sources
Note on robust coloring of planar graphs [PDF]
Opuscula MathematicaWe consider the robust chromatic number \(\chi_1(G)\) of planar graphs \(G\) and show that there exists an infinite family of planar graphs \(G\) with \(\chi_1(G) = 3\), thus solving a recent problem of Bacsó et al.
František Kardoš +2 more
doaj +1 more source
Small cancellation labellings of some infinite graphs and applications [PDF]
Acta Mathematica, 2014 We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups.
Damian Osajda
semanticscholar +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 +6 more sources
Isospectral reduction in infinite graphs [PDF]
Journal of Spectral Theory, 2020 L. A. Bunimovich and B. Z. Webb developed a theory for transforming a finite weighted graph while preserving its spectrum, referred as isospectral reduction theory. In this workwe extend this theory to a class of operators on Banach spaces that include Markov type operators.
Duarte, Pedro, Torres, M. J.
openaire +4 more sources
Schreier graphs of the Basilica group [PDF]
, 2010 With any self-similar action of a finitely generated group $G$ of automorphisms of a regular rooted tree $T$ can be naturally associated an infinite sequence of finite graphs $\{\Gamma_n\}_{n\geq 1}$, where $\Gamma_n$ is the Schreier graph of the action ...
D'Angeli, Daniele +3 more
core +4 more sources
Spectra of infinite graphs with tails [PDF]
, 2015 We compute explicitly (modulo solutions of certain algebraic equations) the spectra of infinite graphs obtained by attaching one or several infinite paths to some vertices of given finite graphs.
L. Golinskii
semanticscholar +1 more source
The Art of Discrete and Applied Mathematics, 2020 Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os, R nyi and Rado. Automorphism groups and connections with model theory are considered.
openaire +5 more sources
Classes of graphs with restricted interval models [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs.
Andrzej Proskurowski, Jan Arne Telle
doaj +2 more sources