Buscar
Mostrando ítems 1-10 de 46
Artículo
The seven-triangle longest-side partition of triangles and mesh quality improvement
(Elsevier, 2008)
A new triangle partition, the seven-triangle longest-edge partition, based on the trisection of the edges is presented and the associated mesh quality improvement property, discussed. The seven-triangle longest-edge ...
Artículo
Quantum social networks
(IOP Science, 2012)
We introduce a physical approach to social networks (SNs) in which each actor is characterized by a yes–no test on a physical system. This allows us to consider SNs beyond those originated by interactions based on ...
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
Factorizing operators on Banach function spaces through spaces of multiplication operators
(Elsevier, 2010)
In order to extend the theory of optimal domains for continuous operators on a Banach function space X(μ) over a finite measure μ, we consider operators T satisfying other type of inequalities than the one given by the ...
Artículo
A theorem of H. Hopf and the Cauchy-Riemann inequality II
(Springer, 2007)
This is a sequel to “A theorem of H. Hopf and the Cauchy-Riemann inequality” [AdCT]. Here the result of the previous paper is extended (see the precise statement in Section 1 of the present paper) to surfaces in ...
Artículo
The space of complete embedded maximal surfaces with isolated singularities in the 3-dimensional Lorentz-Minkowski space
(Springer, 2005)
We prove that a complete embedded maximal surface in L3 with a finite number of sin- gularities is an entire maximal graph with conelike singularities over any spacelike plane, and so, it is asymptotic to a spacelike ...
Artículo
A sufficient degree condition for a graph to contain all trees of size k
(Springer, 2011)
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k ...
Artículo
On the determining number and the metric dimension of graphs
(Combinatorics.org, 2010)
This paper initiates a study on the problem of computing the difference between the metric dimension and the determining number of graphs. We provide new proofs and results on the determining number of trees and Cartesian ...
Artículo
Distinguishing graphs by their left and right homomorphism profiles
(Elsevier, 2011)
We introduce a new property of graphs called ‘q-state Potts unique-ness’ and relate it to chromatic and Tutte uniqueness, and also to ‘chromatic–flow uniqueness’, recently studied by Duan, Wu and Yu. We establish for ...
Artículo
Optimal Domains for L0-valued Operators Via Stochastic Measures
(Springer, 2007)
We study extension of operators T : E → L0([0, 1]), where E is an F–function space and L0([0, 1]) the space of measurable functions with the topology of convergence in measure, to domains larger than E, and we study the ...