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

Title:	Extremal trees for new lower bounds on the k-independence number.
Authors:	Nacera, Meddah
Keywords:	Domination independence k-independence
Issue Date:	6-Nov-2016
Series/Report no.:	2014;
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 (G) in terms of the order, the chromatic number and the number of supports vertices. Moreover we characterize extremal trees attaining these bounds. k
URI:	http://dspace.univ-ouargla.dz/jspui/handle/123456789/11958
Appears in Collections:	1. Faculté des mathématiques et des sciences de la matière

Files in This Item:

File	Description	Size	Format
Extremal trees for new lower bounds on the k-independence number.pdf		166,1 kB	Adobe PDF	View/Open

DSpace JSPUI