| Type of Material: | Thesis |
| Title: | Studies on some domination parameters in graphs |
| Researcher: | Kulandaivel, M.P. |
| Guide: | Selvaraju, P. |
| Department: | Faculty of Science and Humanities |
| Publisher: | Anna University |
| Place: | Chennai |
| Language: | English |
| Subject: | Graph theory neighborhood connected edge vertex connectivity number |
| Dissertation/Thesis Note: | PhD |
| Fulltext: | Shodhganga |
| 000 | 00000ntm a2200000ua 4500 | |
| 001 | 257219 | |
| 003 | IN-AhILN | |
| 005 | 2013-12-04 10:46:04 | |
| 008 | __ | 130819t####||||ii#||||g|m||||||||||eng|| |
| 035 | __ | |a(IN-AhILN)th_257219 |
| 040 | __ | |aANNA_600025|dIN-AhILN |
| 041 | __ | |aeng |
| 100 | __ | |aKulandaivel, M.P.|eResearcher |
| 110 | __ | |aFaculty of Science and Humanities|bAnna University|dChennai |
| 245 | __ | |aStudies on some domination parameters in graphs |
| 260 | __ | |aChennai|bAnna University |
| 502 | __ | |bPhD |
| 520 | __ | |aBy a graph G = (V,E), we mean a finite undirected connected graph with neither loops nor multiple edges. In chapter 1, we collect some basic definitions and theorems on graphs which are needed for the subsequent chapters. One of the fastest growing area |
| 653 | __ | |aGraph theory neighborhood connected edge vertex connectivity number |
| 700 | __ | |aSelvaraju, P.|eGuide |
| 856 | __ | |uhttp://shodhganga.inflibnet.ac.in/handle/10603/10558|yShodhganga |
| 905 | __ | |anotification |
User Feedback Comes Under This section.