MINIMUM CONVEX COVER OF SPECIAL NONORIENTED GRAPHS

Studia Universitatis Moldaviae: Stiinte Exacte si Economice. 2016;0(2 (92))

 

Journal Homepage

Journal Title: Studia Universitatis Moldaviae: Stiinte Exacte si Economice

ISSN: 1857-2073 (Print); 2345-1033 (Online)

Publisher: Moldova State University

Society/Institution: Moldova State University

LCC Subject Category: Science: Science (General) | Social Sciences: Economic theory. Demography: Economics as a science

Country of publisher: Moldova, Republic of

Language of fulltext: Russian, Romanian, English

Full-text formats available: PDF

 

AUTHORS


Radu BUZATU (Universitatea de Stat din Moldova)

EDITORIAL INFORMATION

Double blind peer review

Editorial Board

Instructions for authors

Time From Submission to Publication: 16 weeks

 

Abstract | Full Text

<p>A vertex set <em>S </em>of a graph <em>G </em>is <em>convex </em>if all vertices of every shortest path between two of its vertices are in <em>S</em>. We say that <em>G </em>has a <em>convex p-cover </em>if  can be covered by <em>p </em>convex sets. The <em>convex cover number </em>of <em>G</em> is the least  for which <em>G</em> has a convex <em>p-</em>cover. In particular, the <em>nontrivial convex cover number </em>of <em>G</em> is the least  for which <em>G</em> has a convex <em>p-</em>cover, where every set contains at least 3 elements.<em> </em>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.</p>