Bounds on the domination number in oriented graphs

Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/13788

Full metadata record

DC Field	Value	Language
dc.contributor.author	Mostafa, Blidia	-
dc.contributor.author	Lyes, Ould-Rabah	-
dc.date.accessioned	2017-04-24T14:55:55Z	-
dc.date.available	2017-04-24T14:55:55Z	-
dc.date.issued	2017-04-24	-
dc.identifier.uri	http://dspace.univ-ouargla.dz/jspui/handle/123456789/13788	-
dc.description	Septième Colloque sur l’Optimisation et les Systèmes d’Information - COSI’2010	en_US
dc.description.abstract	A dominating set of an oriented graph D is a set S of vertices of D such that every vertex not in S is a successor of some vertex of S. The minimum cardinality of a dominating set of D; denoted (D), is the domination number of D. An irredundant set of an oriented graph D is a set S of vertices of D such that every vertex of S has a private successor...	en_US
dc.language.iso	en	en_US
dc.subject	locating-domination	en_US
dc.subject	critical graph	en_US
dc.subject	Mathematics Subject Classifcation	en_US
dc.subject	05C69	en_US
dc.subject	05C15	en_US
dc.title	Bounds on the domination number in oriented graphs	en_US
dc.type	Article	en_US
Appears in Collections:	2. Faculté des nouvelles technologies de l’information et de la communication

Files in This Item:

File	Description	Size	Format
Mostafa Blidia.pdf		202,76 kB	Adobe PDF	View/Open

DSpace JSPUI