Examination of the available ignition delay time data and correlations in the case of methane, butane, heptane, decane, kerosene, Jet-A and <span style="font-size: 12pt; color: #000000; font-style: nor...

The Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex x colored with color i, 1 ≤ i ≤ k, is adjacent to (i 1) vertices colored with each color j, 1 ≤ j ≤ i 1. In this paper we give bounds for the Grundy number of some graphs and Cartesian products of graphs. In particular, we determine an exact value of...

Recently, several RGB-White (RGBW) color filter arrays (CFAs) have been proposed, which have extra white (W) pixels in the filter array that are highly sensitive. Due to the high sensitivity, the W pixels have better SNR (Signal to Noise Ratio) characteristics than other color pixels in the filter array, especially, in low light conditions. However, most of the RGBW CFAs are designed so that th...

In this paper, to segment the regions of the color image for recognition and to solve the problem of noise, spatial characteristics of image are proposed. Also to reduce the number of colors, histogram techniques are used. The results of the proposed region segmentation algorithm are compared with the results of the clustering technique and shows that the proposed algorithm makes much better re...

Let G be a graph on vertices v1,v2, . . . ,vn. The b-chromatic number of G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1≤ i≤ k, has at least one representant xi adjacent to a vertex of every color j, 1 ≤ j 6= i ≤ k. In this paper, we give the exact value for the b-chromatic number of power...

The Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex x colored with color i, 1 ≤ i ≤ k, is adjacent to (i− 1) vertices colored with each color j, 1 ≤ j ≤ i− 1. In this paper we give bounds for the Grundy number of some graphs and cartesian products of graphs. In particular, we determine an exact value ...

What happen in the brain when human beings play games with computers? Here a simple zero-sum game was conducted to investigate how people make decision via their brain even they know that their opponent is a computer. There are two choices (a low or high number) for people and also two strategies for the computer (red color or green color). When the number selected by the human subject meet the...

On the WWW, the transmission time for videos and images impacts the performance of a web site. In order to reduce the bandwidth that is used to transmit images over the Internet, most image formats adopt only a limited number of colors used simultaneously to display color images on a video monitor. Hence, generating a good color palette for a color digitized image is an important task for Inter...

‎Let $f$ be a proper $k$-coloring of a connected graph $G$ and‎ ‎$Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into‎ ‎the resulting color classes‎. ‎For a vertex $v$ of $G$‎, ‎the color‎ ‎code of $v$ with respect to $Pi$ is defined to be the ordered‎ ‎$k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$‎, ‎where $d(v,V_i)=min{d(v,x):~xin V_i}‎, ‎1leq ileq k$‎. ‎If‎ ‎distinct...