On extremal graphs with exactly one Steiner tree connecting any $k$ vertices

Abstract

The problem of determining the largest number f(n; κ ≤ ) of edges for graphs with n vertices and maximal local connectivity at most was considered by Bollobás. Li et al. studied the largest number f(n; κ3 ≤ 2) of edges for graphs with n vertices and at most two internally disjoint Steiner trees connecting any three vertices. In this paper, we further study… (More)

Topics

3 Figures and Tables

Slides referencing similar topics