Buscar
Mostrando ítems 1-3 de 3
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 disjoint paths connecting these vertices. The connectivity κ(G) can be seen as the minimum, over ...
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 ζℓ(x, y), is the maximum number of internally disjoint xy-paths whose lengths are at most ℓ in G. The ...
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 simple graph of order ν. This paper givesthe exact value of this function for all νup to ⌊(16n−15)/5⌋. ...