Buzatu, Radu2023-07-072023-07-072021BUZATU, Radu. Maximum nontrivial convex cover number of join and corona of graphs. În: Buletinul Academiei de Științe a Moldovei. Matematica. 2021, nr.1-2(95-96), pp. 93-98. ISSN 1024-76961024-7696https://msuir.usm.md/handle/123456789/10867Let G be a connected graph. We say that a set S ⊆ X(G) is convex in G if, for any two vertices x, y ∈ S, all vertices of every shortest path between x and y are in S. If 3 ≤ |S| ≤ |X(G)| − 1, then S is a nontrivial set. The greatest p ≥ 2 for which there is a cover of G by p nontrivial and convex sets is the maximum nontrivial convex cover number of G. In this paper, we determine the maximum nontrivial convex cover number of join and corona of graphs.enconvex coverjoin of graphscorona of graphsArticle