Browsing by Author "Balbuena Martínez, Maria Camino Teófila"
Now showing items 2140 of 43

Kernels and partial line digraphs
Balbuena Martínez, Maria Camino Teófila; Guevara, Mucuykak (Elsevier, 201010)
Article
Restricted access  publisher's policyLet D = (V,A) be a digraph with minimum indegree 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 ... 
Locatingdominating sets and identifying codes in Graphs of Girth at least 5
Balbuena Martínez, Maria Camino Teófila; Foucaud, Florent; Hansberg Pastor, Adriana (20150429)
Article
Open AccessLocatingdominating 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. (20100606)
Article
Restricted access  publisher's policyWe 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 nvertex graph of girth g into a graph of girth at least g1 ... 
New small regular graphs of girth 5
Abajo, E.; Araujo Pardo, Gabriela; Balbuena Martínez, Maria Camino Teófila; Bendala García, Manuel Francisco (201708)
Article
Open AccessA (k,g)graph is a kregular 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 (20150820)
Article
Restricted access  publisher's policyA (k; g, h)graph is a kregular 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)
Conference report
Open Access 
On the acyclic disconnection and the girth
Balbuena Martínez, Maria Camino Teófila; Olsen, Mika (20150511)
Article
Open AccessThe 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 edgeconnectivity of 3arc graphs
Balbuena Martínez, Maria Camino Teófila; GarcíaVázquez, Pedro (Iniciativa Digital Politècnica, 2011)
Conference report
Open AccessA 3−arc of a graph G is a 4tuple (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 3arc 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. (20100306)
Article
Restricted access  publisher's policyIn this paper, first we prove that any graph G is 2connected if diam (G)≤ g1 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 (201008)
Article
Restricted access  publisher's policyAn ({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 edgeconnected ... 
On the restricted arcconnectivity of sgeodetic digraphs
Balbuena Martínez, Maria Camino Teófila; GarcíaVázquez, Pedro (201010)
Article
Restricted access  publisher's policyFor a strongly connected digraph D the restricted arcconnectivity λ′(D) is defined as the minimum cardinality of an arccut over all arccuts S satisfying that D  S has a nontrivial strong component D₁ such that DV ... 
On the restricted connectivity and superconnectivity in graphs with given girth
Balbuena Martínez, Maria Camino Teófila; Cera, M; Diánez, A; GarcíaVázquez, P; Marcote Ordax, Francisco Javier (200703)
Article
Restricted access  publisher's policyThe restricted connectivity κ′(G)κ′(G) of a connected graph G is defined as the minimum cardinality of a vertexcut over all vertexcuts 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. (200909)
Article
Restricted access  publisher's policyA 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 ... 
On the λ'optimality of sgeodetic digraphs
Balbuena Martínez, Maria Camino Teófila; GarcíaVázquez, Pedro (Iniciativa Digital Politècnica, 2011)
Conference report
Open AccessFor a strongly connected digraph D the restricted arcconnectivity λ'(D) is defined as the minimum cardinality of an arccut over all arccuts S satisfying that D − S has a non trivial strong component D1 such that D − V ... 
Rainbow connectivity of Moore cages of girth 6
Balbuena Martínez, Maria Camino Teófila; Fresán Figueroa, J.; González Moreno, Diego; Olsen, Mika (20181211)
Article
Open AccessLet be an edgecolored graph. A path of is said to be rainbow if no two edges of have the same color. An edgecoloring of is a rainbowcoloring if for any two distinct vertices and of there are at least internally ... 
Small regular graphs of girth 7
Abreu, Marien; Araujo Pardo, Gabriela; Balbuena Martínez, Maria Camino Teófila; Labbate, D.; Salas Salvado, Jordi (20150701)
Article
Open AccessIn this paper, we construct new infinite families of regular graphs of girth 7 of smallest order known so far. Our constructions are based on combinatorial and geometric properties of (q + 1, 8)cages, for q a prime power. ... 
Some properties of semiregular cages
Balbuena Martínez, Maria Camino Teófila; Marcote Ordax, Francisco Javier; González Moreno, Diego Antonio (2010)
Article
Restricted access  publisher's policyA graph with degree set {r,r + 1} is said to be semiregular. A semiregular cage is a semiregular graph with given girth g and the least possible order. First, an upper bound on the diameter of semiregular graphs with girth ... 
Subdivisions in a bipartite graph
Balbuena Martínez, Maria Camino Teófila; Cera, Martín; GarcíaVázquez, Pedro; Valenzuela, Juan Carlos (Iniciativa Digital Politècnica, 2011)
Conference report
Open AccessGiven a bipartite graph G with m and n vertices, respectively,in its vertices classes, and given two integers s, t such that 2 ≤ s ≤ t, 0 ≤ m−s ≤ n−t, and m+n ≤ 2s+t−1, we prove that if G has at least mn−(2(m−s)+n−t) edges ... 
Sufficient conditions for a digraph to admit a (1,=l)identifying code
Balbuena Martínez, Maria Camino Teófila; Dalfó Simó, Cristina; Martínez Barona, Berenice (2019)
Article
Open AccessA (1, = `)identifying code in a digraph D is a subset C of vertices of D such that all distinct subsets of vertices of cardinality at most ` have distinct closed inneighbourhoods within C. In this paper, we give some ... 
Superconnectivity of graphs with odd girth g and even girth h
Montejano, Luis P.; Balbuena Martínez, Maria Camino Teófila; GarcíaVázquez, Pedro (200909)
Conference report
Restricted access  publisher's policyA 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 ...