Data: 06/08/2020, às 14:00 horas (GMT-3, horário de Brasília).
Título: P3-Hull number of graphs with diameter two
Palestrante: Erika Coelho (UFG)


Abstract: Let G be a finite, simple, undirected graph with vertex set V(G). If there is a vertex subset S de V(G), and every vertex of V(G) with at least two neighbors in S is also a member of S, then S is termed P3-convex. The P3-convex hull of of S is the smallest convex set containing S. The P3-hull number h(G) is the cardinality of a smallest set of vertices whose P3-convex hull is the entire graph. In this paper we establish some bounds on the P3-hull number of graphs with diameter two. Particularly, in biconnected C6-free diameter two graphs the P3-hull number is at most 4. We also establish the upper bounds for strongly regular graphs $G(n,k,b,c)$.