Results 51 to 60 of about 1,555,658 (364)
Isospectral infinite graphs and networks and infinite eigenvalue multiplicities
Networks and Heterogeneous Media, 2009 We considerthe continuous Laplacian on infinite locally finite networks undernatural transition conditions as continuity at the ramificationnodes and Kirchhoff flow conditions at all vertices.
Joachim von Below, José A. Lubary
doaj +1 more source
Discrete Mathematics, 2011 It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary duals. In this paper we illustrate the new theory by exhibiting its implications for the cycle and bond matroids of ...
Henning Bruhn, Reinhard Diestel
openaire +3 more sources
(β)‐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
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
Proper circular arc graphs as intersection graphs of paths on a grid [PDF]
, 2018 In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn)
Galby, Esther +2 more
core +2 more sources
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
On P-transitive graphs and applications [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show that the mu ...
Giacomo Lenzi
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.
Cáceres, José +4 more
openaire +8 more sources
Flip-graph moduli spaces of filling surfaces [PDF]
, 2014 This paper is about the geometry of flip-graphs associated to triangulations of surfaces. More precisely, we consider a topological surface with a privileged boundary curve and study the spaces of its triangulations with n vertices on the boundary curve.
Parlier, Hugo, Pournin, Lionel
core +1 more source
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