2. Articole

Permanent URI for this collectionhttps://msuir.usm.md/handle/123456789/17

Browse

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    MINIMUM CONVEX COVER OF SPECIAL NON ORIENTED GRAPHS
    (CEP USM, 2016) Buzatu, Radu
    A vertex set S of a graph G is convex if all vertices of every shortest path between two of its vertices are in S. We say that G has a convex p-cover if X (G)can be overed by p convex sets. The convex cover number of G Is the least p 2 for which G has a convex p-cover.In particular, the nontrivial convex cover number of G is the least p 2 for which G has a convex p-cover, where every set contains at least 3 elements. In this paper we determine convex cover number and nontrivial convex cover number of special graphs resulting from some operations. We examine graphs resulting from join of graphs, Cartesian product of graphs, lexicographic product of graphs and corona of graphs.