Extremal trees for new lower bounds  on the k-independence number.

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Nacera Meddah et LAMDA-RO	-
dc.date.accessioned	2013-12-19T15:09:21Z	-
dc.date.available	2013-12-19T15:09:21Z	-
dc.date.issued	2013-12-19	-
dc.identifier.issn	kh	-
dc.identifier.uri	http://hdl.handle.net/123456789/2855	-
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 k be a positive integer and G = (V; E) a graph. A subset S of V is a k-independent set of G if the maximum degree of the subgraph induced by the vertices of S is less or equal to k 1. The maximum cardinality of a k-independent set of G is the k-independence number k (G). We give lower bounds on k (G) in terms of the order, the chromatic number and the number of supports vertices. Moreover we characterize extremal trees attaining these bounds.	en_US
dc.language.iso	en	en_US
dc.subject	Domination	en_US
dc.subject	independence	en_US
dc.subject	k-independence	en_US
dc.title	Extremal trees for new lower bounds on the k-independence number.	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
Nacera Meddah.pdf		165,29 kB	Adobe PDF	View/Open

DSpace JSPUI