MINIMUM CONVEX COVER OF  SPECIAL NON ORIENTED  GRAPHS

Buzatu, Radu

dc.contributor.author	Buzatu, Radu
dc.date.accessioned	2017-01-10T11:34:10Z
dc.date.available	2017-01-10T11:34:10Z
dc.date.issued	2016
dc.identifier.citation	BUZATU, Radu. Minimum convex cover of special non oriented graphs. In: Studia Universitatis Moldaviae. Seria Științe exacte și economice: Matematică. Informatică. Fizică. Economie. Revistă științifică. 2016, nr. 2 (92), pp. 46-54.	en
dc.identifier.issn	1857-2073
dc.identifier.uri	http://studiamsu.eu/nr-2-92-2016/
dc.identifier.uri	http://dspace.usm.md:8080/xmlui/handle/123456789/1025
dc.description.abstract	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.	en
dc.description.abstract
dc.language.iso	en	en
dc.publisher	CEP USM	en
dc.subject	nonoriented graphs	en
dc.subject	convex covers	en
dc.subject	convex number	en
dc.subject	operations	en
dc.subject	joins	en
dc.subject	cartesian product	en
dc.subject	corona	en
dc.subject	grafuri neorientate	en
dc.subject	acoperiri convexe	en
dc.subject	numărul acoperirii convexe	en
dc.subject	suma grafurilor	en
dc.title	MINIMUM CONVEX COVER OF SPECIAL NON ORIENTED GRAPHS	en
dc.title.alternative	ACOPERIREA CONVEXĂ MINIMĂ A GRAFURILOR SPECIALE NEORIENTATE	en
dc.type	Article	en