Perfil del autor: Moreno Casablanca, Rocío
Datos institucionales
Nombre | Moreno Casablanca, Rocío |
Departamento | Matemática Aplicada II |
Área de conocimiento | Matemática Aplicada |
Categoría profesional | Profesora Ayudante Doctora |
Correo electrónico | Solicitar |
Estadísticas
-
Nº publicaciones
18
-
Nº visitas
1702
-
Nº descargas
1788
Publicaciones |
---|
Artículo
A comprehensive approach for discrete resilience of complex networks
(AIP Publishing, 2023)
The research and use of the term resilience in various types of technological, physiological, and socioeconomic systems ... |
Artículo
The maximum average connectivity among all orientations of a graph
(Springer, 2021)
For distinct vertices u and v in a graph G, the connectivity between u and v, denoted κG(u,v), is the maximum number of ... |
Artículo
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
(Elsevier, 2021)
Let G be a (multi)graph of order n and let u, v be vertices of G. The maximum number of internally disjoint u–v paths in ... |
Artículo
Characterizing slope regions
(Springer, 2021)
This paper provides a theoretical characterization of monotonically connected image surface regions, called slope regions. ... |
Ponencia
Congratulations! Dual Graphs are Now Orientated!
(Springer, 2019)
A digital image can be perceived as a 2.5D surface consisting of pixel coordinates and the intensity of pixel as height ... |
Ponencia
On the Space Between Critical Points
(Springer, 2019)
The vertices of the neighborhood graph of a digital picture P can be interpolated to form a 2-manifold M with critical ... |
Ponencia
Computing and reducing slope complexes
(Springer, 2019)
In this paper we provide a new characterization of cell de- composition (called slope complex) of a given 2-dimensional ... |
Artículo
Distance and Eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs
(Elsevier, 2019)
This paper is concerned with the strong product of two graphs, and , and bounds on the Wiener index, Hosoya polynomial ... |
Ponencia
Counting slope regions in the surface graphs
(TUGraz OPEN Library, 2019)
The discrete version of a continuous surface sampled at optimum sampling rate can be well expressed in form of a neighborhood ... |
Artículo
On Generalized 3-Connectivity of the Strong Product of Graphs
(University of Belgrade, 2018)
Let G be a connected graph with n vertices and let k be an integer such that 2 k n. The generalized connectivity k(G) ... |
Artículo
Superconnectivity of Networks Modeled by the Strong Product of Graphs
(University of Belgrade, 2015)
Maximal connectivity and superconnectivity in a network are two important features of its reliability. In this paper, using ... |
Tesis Doctoral
Reliability of networks modelled by graph products
(2014)
A general purpose in Graph Theory is to describe any graph structure and provide all the information about it as possible. ... |
Artículo
Average distance in the strong product of graphs
(Utilitas Mathematica Publishing, 2014)
|
Artículo
On average connectivity of the strong product of graphs
(Elsevier, 2013)
The average connectivity κ(G) of a graph G is the average, over all pairs of vertices, of the maximum number of internally ... |
Artículo
The Menger number of the strong product of graphs
(Elsevier, 2013)
The xy-Menger number with respect to a given integer ℓ, for every two vertices x, y in a connected graph G, denoted by ... |
Artículo
Gromov hyperbolicity in strong product graphs
(E-JC, 2013)
If X is a geodesic metric space and x1; x2; x3 2 X, a geodesic triangle T = fx1; x2; x3g is the union of the three geodesics ... |
Artículo
Toughness of the corona of two graphs
(Taylor and Francis, 2011)
The toughness of a non-complete graph G = (V , E) is defined as τ (G) = min{|S|/ω(G − S)}, where the minimum is taken over ... |
Ponencia
On the vulnerability of some families of graphs
(Iniciativa Digital Politècnica, 2010)
The toughness of a noncomplete graph G is defined as τ (G) = min{|S|/ω(G − S)}, where the minimum is taken over all cutsets S ... |