Chromatic Strong very excellent caterpillar

S Balamurugan


In this paper we introduce a new class of graphs called chromatic strong very excellent and chromatic weak very excellent . A graph G is called a excellent if every vertex of G belongs to gamma (wc) set . We find that the necessary and sufficient conditions for a very excellent caterpillar

Full Text:



N. Sridharan , M. Yamuna , Very Excellent Graphs and Rigid Very Excellent Graphs , AKCE , J. Graphs Combin., 4, No.2, (2007), pp 211- 221


  • There are currently no refbacks.

Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.