Sampathkumar, E. and Acharya, B. D. and Purnima Gupta (2003) Studying properties of graphs through their k-vertex subsets II. notions of domination, coloring and covering. Electronic Notes in Discrete Mathematics, 15. 168 - 174.
Full text not available from this repository. (Request a copy)
Official URL: https://doi.org/10.1016/S1571-0653(04)00571-2
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.
| Item Type: | Article |
|---|---|
| Additional Information: | Proceedings of the R.C. Bose Centenary Symposium on Discrete Mathematics and Applications |
| Uncontrolled Keywords: | Graph, k-degree, k-domination number, k-chromatic number, k-clique, k-vertex cover |
| Subjects: | E Mathematical Science > Mathematics |
| Divisions: | Department of > Mathematics |
| Depositing User: | LA manjunath user |
| Date Deposited: | 22 Dec 2020 10:15 |
| Last Modified: | 06 Feb 2023 10:13 |
| URI: | http://eprints.uni-mysore.ac.in/id/eprint/14285 |
Actions (login required)
 |
View Item |
