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/2801

Full metadata record

DC Field	Value	Language
dc.contributor.author	1 Mostafa Blidia	-
dc.date.accessioned	2013-12-19T14:57:47Z	-
dc.date.available	2013-12-19T14:57:47Z	-
dc.date.issued	2013-12-19	-
dc.identifier.issn	kh	-
dc.identifier.uri	http://hdl.handle.net/123456789/2801	-
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	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.	en_US
dc.language.iso	en	en_US
dc.subject	critical graphs	en_US
dc.subject	Double domination edge	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
M.Blidia.pdf		198,06 kB	Adobe PDF	View/Open

DSpace JSPUI