Now showing items 1-10 of 10

    • Presentation
      Icon

      Combinatorial structures of three vertices and Lie algebras 

      Cáceres González, José; Ceballos González, Manuel; Núñez Valdés, Juan; Puertas González, María Luz; Tenorio Villalón, Ángel Francisco (Computational and Mathematical Methods in Science and Engineering, 2011)
      In this paper, we characterize digraphs of 3 vertices associated with Lie algebras according to isomorphism classes of ...
    • Article
      Icon

      Graph operations and Lie algebras 

      Cáceres González, José; Ceballos González, Manuel; Núñez Valdés, Juan; Puertas González, María Luz (Taylor & Francis, 2013)
      This paper deals with several operations on graphs and combinatorial structures linking them with their associated Lie ...
    • Article
      Icon

      Rebuilding convex sets in graphs 

      Cáceres González, José; Márquez Pérez, Alberto; Oellermann, Ortrud R.; Puertas González, María Luz (2005)
      The usual distance between pairs of vertices in a graph naturally gives rise to the notion of an interval between a pair ...
    • Presentation
      Icon

      Reconstrucción de conjuntos convexos en grafos 

      Cáceres González, José; Márquez Pérez, Alberto; Puertas González, María Luz (Alberto Márquez, 2002)
    • Article
      Icon

      Removing Twins in Graphs to Break Symmetries 

      González Herrera, Antonio; Puertas González, María Luz (MDPI, 2019-11-15)
      Determining vertex subsets are known tools to provide information about automorphism groups of graphs and, consequently ...
    • Article
      Icon

      Resolving sets for Johnson and Kneser graphs 

      Bailey, Robert F.; Cáceres González, José; Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto; Meagher, Karen; Puertas González, María Luz (2013)
      A set of vertices SS in a graph GG is a resolving set for GG if, for any two vertices u,vu,v, there exists x∈Sx∈S such ...
    • Article
      Icon

      Steiner distance and convexity in graphs 

      Cáceres González, José; Márquez Pérez, Alberto; Puertas González, María Luz (2008)
      We use the Steiner distance to define a convexity in the vertex set of a graph, which has a nice behavior in the well-known ...
    • Article
      Icon

      The determining number of Kneser graphs 

      Cáceres González, José; Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto; Puertas González, María Luz (2013)
      A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determined by its action on ...
    • Article
      Icon

      The determining number of Kneser graphs 

      Puertas González, María Luz; Cáceres González, José; Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto (2013)
    • Article
      Icon

      Towards a new framework for domination 

      Cáceres González, José; Márquez Pérez, Alberto; Morales, María; Puertas González, María Luz (2011)
      Dominating concepts constitute a cornerstone in Graph Theory. Part of the efforts in the field have been focused in finding ...