• Algorithms for determining relative position between spheroids and hyperboloids with one sheet 

      Castro-Castro, Paula-María; Dapena, Adriana; Souto Salorio, María José; Tarrío-Tobar, Ana D. (Elsevier, 2019-06)
      [Abstract]: In this work we present a new method for determining relative positions between one moving object, modelled by a bounding spheroid, and surrounding static objects, modelled by circular hyperboloids of one sheet. ...
    • Calculation of the Connected Dominating Set Considering Vertex Importance Metrics 

      Vázquez Araújo, Francisco Javier; Dapena, Adriana; Souto Salorio, María José; Castro-Castro, Paula-María (M D P I AG, 2018-01-28)
      [Abstract] The computation of a set constituted by few vertices to define a virtual backbone supporting information interchange is a problem that arises in many areas when analysing networks of different natures, like ...
    • Classification of the relative positions between a small ellipsoid and an elliptic paraboloid 

      Brozos-Vázquez, Miguel; Pereira Sáez, María José; Souto Salorio, María José; Tarrío-Tobar, Ana D. (Elsevier, 2019-06)
      [Abstract]: We classify all the relative positions between an ellipsoid and an elliptic paraboloid when the ellipsoid is small in comparison with the paraboloid (small meaning that the two surfaces cannot be tangent at two ...
    • Contact detection between a small ellipsoid and another quadric 

      Brozos-Vázquez, Miguel; Pereira Sáez, María José; Rodríguez Raposo, Ana Belén; Souto Salorio, María José; Tarrío-Tobar, Ana D. (Elsevier, 2022-08-03)
      [Abstract] We analyze the characteristic polynomial associated to an ellipsoid and another quadric in the context of the contact detection problem. We obtain a necessary and sufficient condition for an efficient method ...
    • Graphs with isolation number equal to one third of the order 

      Lemańska, Magdalena; Mora, Mercè; Souto Salorio, María José (Elsevier B.V., 2024-05)
      [Absctract]: A set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by ι(G), is the minimum cardinality of an isolating ...
    • Isolation Number versus Domination Number of Trees 

      Lemanska, Magdalena; Souto Salorio, María José; Dapena, Adriana; Vázquez Araújo, Francisco José (MDPI, 2021-06)
      [Abstract] If 𝐺 = (Vɢ,Eɢ) is a graph of order n, we call 𝑆 ⊆ Vɢ an isolating set if the graph induced by Vɢ − Nɢ[𝑆] contains no edges. The minimum cardinality of an isolating set of 𝐺 is called the isolation number of ...
    • María Josefa Wonenburger Planells: Mujer y Matemática 

      Souto Salorio, María José; Tarrío-Tobar, Ana D. (Real Sociedad Matemática Española, 2006)
      [Resumen] En el artículo se describe la vida personal y profesional de la matemática María Wonenburger, mujer que desarrolló su carrera en una época en la que las mujeres tenían un acceso dificil a las carreras científicas ...
    • On the Degree in Categories of Complexes of Fixed Size 

      Chaio, Claudia; Pratti, Isabel; Souto Salorio, María José (Springer, 2019-02-01)
      [Abstract]: We consider Λ an artin algebra and n ≥ 2. We study how to compute the left and right degrees of irreducible morphisms between complexes in a generalized standard Auslander-Reiten component of Cn(proj Λ) with ...
    • El proyecto “Geometría aplicada” 

      Brozos-Vázquez, Miguel; Castro-Castro, Paula-María; Dapena, Adriana; Pereira Sáez, María José; Rodríguez Raposo, Ana Belén; Souto Salorio, María José; Tarrío-Tobar, Ana D.; Vázquez Araújo, Francisco Javier (Universidade da Coruña, 2020)
      [Resumen]: El proyecto “Geometría aplicada” ha sido seleccionado en la III edición de la exposición “Campus Vivo. Investigar en la Universidad”, una iniciativa de la Conferencia de Rectores de las Universidades Españolas ...
    • Resolving Sets Tolerant to Failures in Three-Dimensional Grids 

      Mora, Mercè; Souto Salorio, María José; Tarrío-Tobar, Ana D. (Springer Nature, 2022)
      [Abstract] An ordered set S of vertices of a graph G is a resolving set for G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of ...
    • The Auslander-Reiten quiver of the category of m−periodic complexes 

      Chaio, Claudia; González Chaio, Alfredo; Pratti, Isabel; Souto Salorio, María José (Elsevier, 2024-05)
      [Abstract]: Let A be an additive k−category and C≡m(A) be the category of m−periodic complexes. For any integer m > 1, we study conditions under which the compression b functor Fm : C (A) → C≡m(A) preserves or reflects ...