Listar por autor "García Vázquez, Pedro"
Mostrando ítems 1-18 de 18
-
Artículo
Construcción de un instrumento para medir la utilidad percibida de las TIC usadas en la por estudiantes de arquitectura técnica
(Universidad de Sevilla, 2016)Se ha realizado una investigación acerca del uso del ordenador y de los objetos de aprendizaje que utilizan los estudiantes ...
-
Libro
Control de costes por anticipación
(Editorial Universidad de Sevilla, 2015) -
Artículo
Extremal K-(s,K-t)-free bipartite graphs
(Association DMTCS, 2008)In this paper new exact values of the Zarankiewicz function z(m, n; s, t) are obtained assuming certain requirements on ...
-
Tesis Doctoral
Grafos contractibles a un grafo completo
(2006)Los objetivos de esta tesis se pueden enmarcar dentro de la Teoría Extremal de Grafos. Uno de los problemas más conocidos ...
-
Ponencia
Máximas aristas de un grafo sin subgrafos menores completos
(Alberto Márquez, 2002) -
Artículo
On average connectivity of the strong product of graphs
(Elsevier, 2013)The average connectivity κ(G) of a graph G is the average, over all pairs of vertices, of the maximum number of internally ...
-
Artículo
On Generalized 3-Connectivity of the Strong Product of Graphs
(University of Belgrade, 2018)Let G be a connected graph with n vertices and let k be an integer such that 2 k n. The generalized connectivity ...
-
Artículo
On the bipartite vertex frustration of graphs
(Elsevier, 2016-10)The bipartite vertex (resp. edge) frustration of a graph G, denoted by ψ(G) (resp. φ(G)), is the smallest number of ...
-
Artículo
On the connectivity and restricted edge-connectivity of 3-arc graphs
(Elsevier, 2014-01-10)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 ...
-
Artículo
On the Minimum Order of Extremal Graphs to have a Prescribed Girth
(SIAM, 2007)We show that any n‐vertex extremal graph G without cycles of length at most k has girth exactly $k+1$ if $k\ge 6$ and ...
-
Ponencia
On the vulnerability of some families of graphs
(Iniciativa Digital Politècnica, 2010)The toughness of a noncomplete graph G is defined as τ (G) = min{|S|/ω(G − S)}, where the minimum is taken over all ...
-
Ponencia
El problema de Turán sobre grafos bipartitos completos
(Alberto Márquez, 2002) -
Tesis Doctoral
Problemas extremales en teoría de grafos
(2003)Uno de los problemas más representativos dentro de la Teoría Extremal de Grafos consiste en el estudio de los valores de ...
-
Tesis Doctoral
Reliability of networks modelled by graph products
(2014-05-26)A general purpose in Graph Theory is to describe any graph structure and provide all the information about it as possible. ...
-
Artículo
Superconnectivity of Networks Modeled by the Strong Product of Graphs
(University of Belgrade, 2015)Maximal connectivity and superconnectivity in a network are two important features of its reliability. In this paper, ...
-
Artículo
The Menger number of the strong product of graphs
(Elsevier, 2013)The xy-Menger number with respect to a given integer ℓ, for every two vertices x, y in a connected graph G, denoted by ...
-
Artículo
Topological minors in bipartite graphs
(Springer, 2011-10-15)For a bipartite graph G on m and n vertices, respectively, in its vertices classes, and for integers s and t such that 2 ...
-
Artículo
Toughness of the corona of two graphs
(Taylor and Francis, 2011)The toughness of a non-complete graph G = (V , E) is defined as τ (G) = min{|S|/ω(G − S)}, where the minimum is taken ...