An Analysis Upon Total Domination of Colouring and Transversals of Graphs

Published in Journal

Journal of Advances in Science and Technology [JAST] (Vol:9/ Issue: 19) DOI: 10.29070/JAST
Authors: Amit Kumar*,
Subjects: Science & Technology

Year: May, 2015
Volume: 9 / Issue: 19
Pages: 0 - 0 (0)
Publisher: Ignited Minds Journals
Source:
E-ISSN: 2230-9659
DOI:
Published URL: http://ignited.in/a/55291
Published On: May, 2015

Article Details

An Analysis upon Total Domination of Colouring and Transversals of Graphs | Original Article

Amit Kumar*, in Journal of Advances in Science and Technology | Science & Technology

Download PDF

View PDF

ABSTRACT:

A vertex- coloring of a graph is called a bounded monochromatic component colorings (BMC) if every color-class induces monochromatic components containing at most a certain bounded num¬ber of vertices. A proper coloring for instance is a BMC coloring in which every color-class induces monochromatic components of order one. We investigate three different aspects of BMC colorings.