Let G = (V, E) be a graph. We define strong dominating color number of a graph G as the maximum number of color classes which are strong dominating sets of G, and is denoted by sd(G) , where the maximum is taken over all  -coloring of G. This paper determines the exact values of strong dominating color number of sum and Cartesian product of graphs.

A new method for text localization in cover color pages and general color document images is presented. The colors of the document image are reduced to a small number using a color reduction technique based on a Kohonen Self Organized Map (KSOM) neural network. Each color defines a color plane in which the connected components (CCs) are extracted. In each color plane a CC filtering procedure is...

A wide variety of color schemes have been devised for mapping scalar data to color. Some use the data value to index a color scale. Others assign colors to different, usually blended disjoint materials, to handle areas where materials overlap. A number of methods can map low-dimensional data to color, however, these methods do not scale to higher dimensional data. Likewise, schemes that take a ...

Multiple color stripes have been employed for structured light-based rapid range imaging to increase the number of uniquely identifiable stripes. The use of multiple color stripes poses two problems: (1) object surface color may disturb the stripe color and (2) the number of adjacent stripes required for identifying a stripe may not be maintained near surface discontinuities such as occluding b...

The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the bchromatic number is equal to the chromatic number for every induced subgraph.

Background & Objective: Micronucleus assay of buccal mucosa cells is a simple bio- monitoring method for diagnosing the genetic damages of toxic agents. The aim was to study the genotox...

Reduction of number of image colors is an important task for presentation, transmission, segmentation, and compression of color images. In most cases, it is easier to process and understand an image with a limited number of colors. Color image reduction speeds up the manipulations on an image and reduces the storage cost and transmission cost. Various techniques have been proposed for color ima...

Common methods to design heat exchanger networks (HENs) by pinch technology usually need an evolutionary step to reduce the number of heat transfer units. This step <span style="font-size: 10pt; color:...