Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Bernardo San Martín"'
Autor:
Bernardo San Martín, Víctor F. Sirvent
Publikováno v:
Chaos, Solitons & Fractals. 169:113239
Autor:
Manuel Barros Monge, Alcídes Zambrano, Ximena Cea, Manuel De La Prida, Mauricio Tapia, Luis Soto, Laura Mendoza, Jorge Dreyse, Juanita Pavié, Karen Czischke, Mónica Gutiérrez, Mauricio Jalón, Fernando Saldías, Jorge Villalobos, Rafael Silva, Rosa Helena Roldan, Bernardo San Martín, Mauricio Riquelme, María Guacolda Benavides
Publikováno v:
Epidemiology.
Publikováno v:
Bulletin of the Brazilian Mathematical Society, New Series. 48:649-662
It is well known that the geometric Lorenz attractor is $$\mathcal {K}^*$$ -expansive. In this paper we prove that the Rovella attractor is also $$\mathcal {K}^*$$ -expansive in an almost 2-persistent way.
Publikováno v:
Linear Algebra and its Applications. 493:28-36
Given a graph G . The fewest number of vertices whose deletion yields a bipartite graph from G was defined by S. Fallat and Yi-Zheng Fan to be the vertex bipartiteness of G and it is denoted by υ b ( G ) . We consider the set Σ k ( n ) defined by {
Autor:
Bernardo San Martín, Nelda Jaque
We study two variations of Bowen's definitions of topological entropy based on separated and spanning sets which can be applied to the study of discontinuous semiflows on compact metric spaces. We prove that these definitions reduce to Bowen's ones i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::547208270a3ddb6f62ce23836247d5d0
Publikováno v:
Linear Algebra and its Applications. 478:241-255
Applying the Cauchy–Schwarz inequality, we obtain a sharp upper bound on the Randic energy of a bipartite graph and of graphs whose adjacency matrix is partitioned into blocks with constant row sum.
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Let G be a simple undirected graph of order n with vertex set V ( G ) = { v 1 , v 2 , … , v n } . Let d i be the degree of the vertex v i . The Randic matrix R = ( r i , j ) of G is the square matrix of order n whose ( i , j ) -entry is equal to 1
Publikováno v:
DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
In this paper we prove that there exists a positive integer $k$ with the following property: Every compact $3$-manifold with boundary carries a $C^\infty$ vector field exhibiting a $C^k$-robust attractor without dominated splitting in a robust sense.
Publikováno v:
Linear Algebra and its Applications. 442:156-164
This paper deals with the notions of 0-incidence and 1-incidence between edges on a directed graph associated to the line graph of a graph. The Laplacian energy and the signless Laplacian energy are obtained in a new way. From these results a relatio
Autor:
Bernardo San Martín
Publikováno v:
Annales de l'Institut Henri Poincaré C, Analyse non linéaire. 15:651-659
In the present paper we shall prove that the result in [2.2], concerning the measure of the bifurcating set for generic one-parameter families through a simple contracting singular cycle with only one periodic orbit, is still true for cycles with any