Generalizations of independence and chromatic numbers of a graph

Sampathkumar, E. (1993) Generalizations of independence and chromatic numbers of a graph. Discrete Mathematics, 115 (1-3). pp. 245-251.

Text Generalizations of independence and chromatic numbers of a graph.pdf Restricted to Registered users only Download (436kB) | Request a copy

Abstract

Let G = (V, E) be a graph and k greater-than-or-equal-to 2 be an integer. A set S subset-of V is k-independent if every component in the subgraph S] induced by S has order at most k - 1. The general chromatic number chi(k)(G) of G is the minimum order n of a partition P of the set V such that each set V(i) in P is k-independent. This paper develops properties of chi(k)(G) which are generalizations of well-known properties of chromatic number.

Item Type:	Article
Subjects:	E Mathematical Science > Mathematics
Divisions:	Department of > Mathematics
Depositing User:	Users 23 not found.
Date Deposited:	04 May 2021 09:38
Last Modified:	04 May 2021 09:38
URI:	http://eprints.uni-mysore.ac.in/id/eprint/16311

Actions (login required)

View Item