DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/12038| Title: | Double domination edge removal critical graphs |
| Authors: | Mostafa, Blidia Mustapha, Chellali Sou ane, Kheli |
| Keywords: | critical graphs graph |
| Issue Date: | 7-Nov-2016 |
| Series/Report no.: | 2015; |
| Abstract: | Abstract Let G be a graph without isolated vertices: A set S V (G) is a double dominating set if every vertex in V (G) is adjacent to at least two vertices in S. G is said edge removal critical graph with respect to double domination, if the removal of any edge increases the double domination number. In this paper, we rst give a necessary and su¢ cient conditions for -critical graphs. Then we provide a constructive characterization of critical trees. |
| URI: | http://dspace.univ-ouargla.dz/jspui/handle/123456789/12038 |
| Appears in Collections: | 1. Faculté des mathématiques et des sciences de la matière |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Double domination edge removal critical graphs.pdf | 199,1 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.