Double domination edge removal critical graphs

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Mostafa, Blidia	-
dc.contributor.author	Mustapha, Chellali	-
dc.contributor.author	Sou ane, Kheli	-
dc.date.accessioned	2016-11-07T08:45:04Z	-
dc.date.available	2016-11-07T08:45:04Z	-
dc.date.issued	2016-11-07	-
dc.identifier.uri	http://dspace.univ-ouargla.dz/jspui/handle/123456789/12038	-
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.relation.ispartofseries	2015;	-
dc.subject	critical graphs	en_US
dc.subject	graph	en_US
dc.title	Double domination edge removal critical 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
Double domination edge removal critical graphs.pdf		199,1 kB	Adobe PDF	View/Open

DSpace JSPUI