Please use this identifier to cite or link to this item:
Title: Double domination edge removal critical graphs
Authors: 1 Mostafa Blidia
Keywords: critical graphs
Double domination edge
Issue Date: 19-Dec-2013
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 trees.
Description: 7 ieme Colloque sur l Optimisation et les Systèmes d’Information COSI 2010 18-20 Avril 2010
ISSN: kh
Appears in Collections:1. Faculté des mathématiques et des sciences de la matière

Files in This Item:
File Description SizeFormat 
M.Blidia.pdf198,06 kBAdobe PDFView/Open

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