Ara es mostren els items 14-33 de 43

    • Edge-superconnectivity of semiregular cages with odd girth 

      Balbuena Martínez, Maria Camino Teófila; Salas, Julián; González-Moreno, Diego (Iniciativa Digital Politècnica, 2011)
      Text en actes de congrés
      Accés obert
      A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges incident with some vertex of minimum degree. A graph G is said to be a {d, d + 1}- semiregular graph if all its vertices have ...
    • Estudios sobre algunas nuevas clases de conectividad condicional en grafos dirigidos 

      Balbuena Martínez, Maria Camino Teófila (Universitat Politècnica de Catalunya, 1995-11-24)
      Tesi
      Accés obert
      La conectividad condicional, definida por Harary en 1983, mide el mínimo número de vértices (o ramas) que hay que eliminar de un grafo o digrafo de forma que todas las componentes conexas resultantes tengan una propiedad ...
    • Further topics in connectivity 

      Balbuena Martínez, Maria Camino Teófila; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel (CRC Press Taylor & Francis Group, 2013-12-05)
      Capítol de llibre
      Accés obert
      Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (sufficient) conditions under which a graph or digraph has a given connectivity or edge-connectivity. First, we describe results ...
    • Identifying codes from the spectrum of a graph or digraph 

      Balbuena Martínez, Maria Camino Teófila; Dalfó Simó, Cristina; Martínez Barona, Berenice (LaBRI, 2019)
      Text en actes de congrés
      Accés obert
    • Identifying codes in line digraphs 

      Balbuena Martínez, Maria Camino Teófila; Dalfó Simó, Cristina; Martínez Barona, Berenice (Elsevier, 2020-10-15)
      Article
      Accés obert
      Given an integer ` = 1, a (1, = `)-identifying code in a digraph is a dominating subset C of vertices such that all distinct subsets of vertices of cardinality at most ` have distinct closed in-neighbourhood within C. In ...
    • Improving bounds on the order of regular graphs of girth 5 

      Abajo Casado, Encarnación; Balbuena Martínez, Maria Camino Teófila; Bendala García, Manuel Francisco; Marcote Ordax, Francisco Javier (2019-10-01)
      Article
      Accés obert
      A -graph is a -regular graph with girth and a -cage is a -graph with the fewest possible number of vertices . Constructing -cages and determining the order are both very hard problems. For this reason, an intensive line ...
    • Incidence matrices of projective planes and of some regular bipartite graphs of girth 6 with few vertices 

      Balbuena Martínez, Maria Camino Teófila (2008-11)
      Article
      Accés obert
      Let q be a prime power and r=0,1...,q−3. Using the Latin squares obtained by multiplying each entry of the addition table of the Galois field of order q by an element distinct from zero, we obtain the incidence matrices ...
    • Kernels and partial line digraphs 

      Balbuena Martínez, Maria Camino Teófila; Guevara, Mucuy-kak (Elsevier, 2010-10)
      Article
      Accés restringit per política de l'editorial
      Let D = (V,A) be a digraph with minimum in-degree at least 1 and girth at least l+1, where l ≥ 1. In this work, the following result is proved: a digraph D has a (k,l)-kernel if and only if its partial line digraph LD ...
    • Locating-dominating sets and identifying codes in Graphs of Girth at least 5 

      Balbuena Martínez, Maria Camino Teófila; Foucaud, Florent; Hansberg Pastor, Adriana (2015-04-29)
      Article
      Accés obert
      Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified ...
    • New families of graphs without short cycles and large size 

      Abajo, E.; Balbuena Martínez, Maria Camino Teófila; Diánez, A. (2010-06-06)
      Article
      Accés restringit per política de l'editorial
      We denote by ex $(n; {C^3,C^4,…Cs})$ or fs(n) the maximum number of edges in a graph of order n and girth at least s+1. First we give a method to transform an n-vertex graph of girth g into a graph of girth at least g-1 ...
    • New small regular graphs of girth 5 

      Abajo, E.; Araujo Pardo, Gabriela; Balbuena Martínez, Maria Camino Teófila; Bendala García, Manuel Francisco (2017-08)
      Article
      Accés obert
      A (k,g)-graph is a k-regular graph with girth g and a (k,g)-cage is a (k,g)-graph with the fewest possible number of vertices. The cage problem consists of constructing (k,g)-graphs of minimum order n(k,g). We focus on ...
    • On a conjecture on the order of cages with a given girth pair 

      Balbuena Martínez, Maria Camino Teófila; Salas, J (2015-08-20)
      Article
      Accés restringit per política de l'editorial
      A (k; g, h)-graph is a k-regular graph of girth pair (g, h) where g is the girth of the graph, h is the length of a smallest cycle of different parity than g and g < h. A (k; g, h)-cage is a (k; g, h)-graph with the least ...
    • On identifying codes in line digraphs 

      Dalfó Simó, Cristina; Balbuena Martínez, Maria Camino Teófila; Martínez Barona, Berenice (2019)
      Text en actes de congrés
      Accés obert
    • On the acyclic disconnection and the girth 

      Balbuena Martínez, Maria Camino Teófila; Olsen, Mika (2015-05-11)
      Article
      Accés obert
      The acyclic disconnection, (omega) over right arrow (D), of a digraph D is the maximum number of connected components of the underlying graph of D - A(D*), where D* is an acyclic subdigraph of D. We prove that (omega) over ...
    • On the connectivity and restricted edge-connectivity of 3-arc graphs 

      Balbuena Martínez, Maria Camino Teófila; García-Vázquez, Pedro (Iniciativa Digital Politècnica, 2011)
      Text en actes de congrés
      Accés obert
      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 G is ...
    • On the connectivity and superconnected graphs with small diameter 

      Balbuena Martínez, Maria Camino Teófila; Marshall, Kim; Montejano, Luis P. (2010-03-06)
      Article
      Accés restringit per política de l'editorial
      In this paper, first we prove that any graph G is 2-connected if diam (G)≤ g-1 for even girth g, and for odd girth g and maximum degree $\Delta$ ≤ 2$\delta$-1 where $\delta$ is the minimum degree. Moreover, we prove that ...
    • On the connectivity of semiregular cages 

      Balbuena Martínez, Maria Camino Teófila; González Moreno, Diego Antonio; Marcote Ordax, Francisco Javier (2010-08)
      Article
      Accés restringit per política de l'editorial
      An ({r,r+1};g)-cage is a graph with degree set {r,r+1}, girth g, and with the smallest possible order; every such graph is called a semiregular cage. In this article, semiregular cages are shown to be maximally edge-connected ...
    • On the restricted arc-connectivity of s-geodetic digraphs 

      Balbuena Martínez, Maria Camino Teófila; García-Vázquez, Pedro (2010-10)
      Article
      Accés restringit per política de l'editorial
      For a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the minimum cardinality of an arc-cut over all arc-cuts S satisfying that D - S has a non-trivial strong component D₁ such that D-V ...
    • On the restricted connectivity and superconnectivity in graphs with given girth 

      Balbuena Martínez, Maria Camino Teófila; Cera, M; Diánez, A; García-Vázquez, P; Marcote Ordax, Francisco Javier (2007-03)
      Article
      Accés restringit per política de l'editorial
      The restricted connectivity κ′(G)κ′(G) of a connected graph G is defined as the minimum cardinality of a vertex-cut over all vertex-cuts X such that no vertex uu has all its neighbors in X; the superconnectivity κ1(G)κ1(G) ...
    • On the superconnectivity in graphs with odd girth g and even girth h 

      Balbuena Martínez, Maria Camino Teófila; Montejano, Luis P. (2009-09)
      Article
      Accés restringit per política de l'editorial
      A maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) if all disconnecting sets of cardinality δ are the neighborhood of some vertex of degree δ. Sufficient conditions on the ...