Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/13788
Title: Bounds on the domination number in oriented graphs
Authors: Mostafa, Blidia
Lyes, Ould-Rabah
Keywords: locating-domination
critical graph
Mathematics Subject Classifcation
05C69
05C15
Issue Date: 24-Apr-2017
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...
Description: Septième Colloque sur l’Optimisation et les Systèmes d’Information - COSI’2010
URI: http://dspace.univ-ouargla.dz/jspui/handle/123456789/13788
Appears in Collections:2. Faculté des nouvelles technologies de l’information et de la communication

Files in This Item:
File Description SizeFormat 
Mostafa Blidia.pdf202,76 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.