Browsing by Author "GarcíaVázquez, Pedro"
Now showing items 17 of 7

A sufficient condition for Pkpath graphs being rconnected
Balbuena Martínez, Maria Camino Teófila; GarcíaVázquez, Pedro (200708)
Article
Open AccessGiven an integer k≥1 and any graph G; the path graph $P_k(G)$ has for vertices the paths of length k in G, and two vertices are joined by an edge if and only if the intersection of the corresponding paths forms a path of ... 
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 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 vulnerability of some families of graphs
Moreno Casablanca, Rocío; Díanez, Ana R.; GarcíaVázquez, Pedro (Iniciativa Digital Politècnica, 2011)
Conference report
Open AccessThe toughness of a noncomplete graph G is defined as τ (G) = min{S/ω(G − S)}, where the minimum is taken over all cutsets S of vertices of G and ω(G − S) denotes the number of components of the resultant graph G − S by ... 
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 ... 
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 ... 
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 ...