Surekha, . (2013) A study of inverse, mixed block domination and related concepts in graphs. Phd. Thesis thesis, Manipal Institute of Technology, Manipal.
![[img]](http://eprints.manipal.edu/style/images/fileicons/application_zip.png) |
Archive (ZIP)
Surekha.zip - Submitted Version Restricted to Registered users only Download (6MB) | Request a copy |
Abstract
In this chapter some basic definitions of graph theory and domination are given. A bird’s eye view of brief survey of domination results and varieties of domination are discussed. Motivation and few applications are cited. Recently, Sampathkumar and Pushpalatha introduced strong domination and mixed domination. J.H.Hattingh, R.C.Laskar, Henningh and others have worked on this domain and many papers are found in literature and few of the important results are quoted. For standard notations and definition refer [1 and 2].
| Item Type: | Thesis (Phd. Thesis) |
|---|---|
| Subjects: | Engineering > MIT Manipal > Mathematics |
| Depositing User: | MIT Library |
| Date Deposited: | 30 Apr 2016 15:32 |
| Last Modified: | 30 Apr 2016 15:32 |
| URI: | http://eprints.manipal.edu/id/eprint/145929 |
Actions (login required)
 |
View Item |