Buscar
Mostrando ítems 41-50 de 678
Artículo
Locally grid graphs: classification and Tutte uniqueness
(2003)
We define a locally grid graph as a graph in which the structure around each vertex is a 3×3 grid ⊞, the canonical examples being the toroidal grids Cp×Cq. The paper contains two main results. First, we give a complete ...
Artículo
On the connectivity and restricted edge-connectivity of 3-arc graphs
(Elsevier, 2014-01-10)
A 3 − arc of a graph G is a 4-tuple (y, a, b, x) of vertices such that both (y, a, b) and (a, b, x) are paths of length two in G. Let ←→G denote the symmetric digraph of a graph G. The 3-arc graph X(G) of a given graph ...
Artículo
Trisections of a 3-rotationally symmetric planar convex body minimizing the maximum relative diameter
(Elsevier, 2014)
In this work we study the fencing problem consisting of finding a trisection of a 3-rotationally symmetric planar convex body which minimizes the maximum relative diameter. We prove that an optimal solution is given by ...
Artículo
A note on uniformly dominated sets of summing operators
(2002)
Let Y be a Banach space that has no finite cotype and p a real number satisfying 1≤p<∞. We prove that a set ℳ⊂Πp(X,Y) is uniformly dominated if and only if there exists a constant C>0 such that, for every finite set ...
Artículo
Monochromatic geometric k-factors for bicolored point sets with auxiliary points
(2014)
Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We consider the problem of finding such a k-factor of S by using auxiliary points. Two types are considered: ...
Artículo
Homological spanning forest framework for 2D image analysis
(2012)
A 2D topology-based digital image processing framework is presented here. This framework consists of the computation of a flexible geometric graph-based structure, starting from a raster representation of a digital image ...
Artículo
Boolean Functions and Permanents of Sylvester Hadamard Matrices
(MDPI, 2021-01-17)
One of the fastest known general techniques for computing permanents is Ryser’s formula. On this note, we show that this formula over Sylvester Hadamard matrices of order 2m, Hm, can be carried out by enumerating m-variable ...
Artículo
Cups products in Z2-cohomology of 3D polyhedral complexes
(2012)
Let I=(Z3,26,6,B) be a 3D digital image, let Q(I) be the associated cubical complex and let ∂Q(I) be the subcomplex of Q(I) whose maximal cells are the quadrangles of Q(I) shared by a voxel of B in the foreground -- the ...
Artículo
Complex Interpolation of Operators and Optimal Domains
(Springer, 2014)
Let X0 and X1 be two order continuous Banach function spaces on a finite measure space, (E0, E1) a Banach space interpolation pair, and T : X0 + X1 → E0 + E1 an admissible operator between the pairs (X0, X1) and (E0, ...