Title of article :
Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering
Author/Authors :
Sampathkumar، نويسنده , , E. and Acharya، نويسنده , , B.D. and Gupta، نويسنده , , Purnima، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Abstract :
For terminology and notation in graph theory, we refer the reader to B. BOLLOBAS [12]; others will be specified in the text as and when found necessary. The graphs considered in this paper, unless mentioned otherwise, are possibly infinite, simple and without loops.
Keywords :
graph , k-degree , k-chromatic number , k-domination number , k-vertex cover , k-clique
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
