Prefer a chat interface with context about you and your work?
Sobre o número envoltório para prismas complementares de grafos conexos $G$ e $\overline{G}$
In the geodetic convexity, a set of vertices S of a graph G is convex if all vertices belonging to any shortest path between two vertices of S lie in S. The convex hull H(S) of S is the smallest convex set containing S. If H(S) = V (G), then …