Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/2837
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mostafa Blidia and Lyes Ould-Rabah | - |
dc.date.accessioned | 2013-12-19T15:04:56Z | - |
dc.date.available | 2013-12-19T15:04:56Z | - |
dc.date.issued | 2013-12-19 | - |
dc.identifier.issn | kh | - |
dc.identifier.uri | http://hdl.handle.net/123456789/2837 | - |
dc.description | 7 ieme Colloque sur l Optimisation et les Systèmes d’Information COSI 2010 18-20 Avril 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, that is, for all x 2 S; jO[x] O[S x]j 1. The irredundance number of an oriented graph, denoted ir(D), is the least number of vertices in a maximal irredundant set. We denote by 1 (D) and s(D); the number of edges in a maximum matching and support vertices of the underlyng graph of an oriented graph D; respectively. In this paper, we show that for every oriented graph D, s(D) ir(D) (D) 6 n(D) 1 (D). We also give characterizations of oriented trees satisfying (T ) = n(T ) 1 (T ) and oriented graphs satisfying (D) = s(D) and s(D) = n(D) 1 (D); respectively. | en_US |
dc.language.iso | en | en_US |
dc.subject | locating-domination | en_US |
dc.subject | critical graph.2000 Mathematics Subject Classification: 05C69, 05C15. | en_US |
dc.title | Bounds on the domination number in oriented graphs | en_US |
dc.type | Article | en_US |
Appears in Collections: | 1. Faculté des mathématiques et des sciences de la matière |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Mostafa Blidia.pdf | 202,76 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.