Listar Artículos (Matemática Aplicada I) por autor "Diánez Martínez, Ana Rosa"
Mostrando ítems 1-11 de 11
-
Artículo
A link between menger’s theorem and infinite euler graphs
(Akadémiai Kiadó, 1997) -
Artículo
Extremal Graphs without Topological Complete Subgraphs
(2004)The exact values of the function $ex(n;TK_{p})$ are known for ${\lceil \frac{2n+5}{3}\rceil}\leq p < n$ (see [Cera, Diánez, ...
-
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 infinite outerplanar graphs
(Institute of Mathematics of the Czech Academy of Sciences, 1994)In this Note, we study infinite graphs with locally finite outerplane embeddings, given a characterization by forbidden subgraphs
-
Artículo
On Sedlacek's C-Graphs
(Societatea de Științe Matematice din România, 1993)In this Note, we study some properties of Sedlacek's C-graphs (see [3], [4] and [5]). In particular, we give new methods ...
-
Artículo
Size of graphs with high girth
(Elsevier, 2007)Let n≥4 be a positive integer and let ex (ν;{C3, . . . , Cn}) denote the maximum number of edges in a {C3, . . . , Cn}-free ...
-
Artículo
The center of an infinite graph
(1996)In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the ...
-
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
The Size of a Graph Without Topological Complete Subgraphs
(2000)In this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n ...
-
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 ...