since long time ago, mobile metaphor and simile are most important mean for poetic images creation. the present paper studies bayati works according to the important role of the colors in poetic images creation in. we came to conclusion that the poet has used the colors in order to express his feelings, his unsatisfactory as well goals, aims and ideologies. the colors application or secret sema...

Given a graph G and an edge coloring C of G, an alternating cycle of G is such a cycle of G in which any adjacent edges have distinct colors. Let dc(v), named the color degree of a vertex v, be defined as the maximum number of edges incident with v, that have distinct colors. In this paper, some color degree conditions for the existence of alternating cycles of length 3 or 4 are obtained. We al...

This work investigates the Color-Magnitude (C-M) relation for early-type galaxies. The recent WISE and Spitzer infrared surveys have opened up the possibility to study the C-M relation for galaxies in the nearand mid-Infrared. For the C-M relation four different samples from different sources are used, ranging from a Virgo Cluster sample of dwarf ellipticals to a large sample of bright early-ty...

We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction τ of all points in Q are of color c, must be reported. We describe several data structures for that problem that use pseudo-linear space and answer queries in poly-logarithmic time.

We study a discrete diffusion process introduced in some combinatorial games called FLOODIT and MADVIRUS that can be played online [1, 2] and whose computational complexity has been recently studied [3, 4]. The flooding dynamics used in those games can be defined for any colored graph. It is shown in [5] that studying this dynamics directly on general graph is a valuable approach to understand ...

A graph G on a topological space X as its set of vertices is clopen if the edge relation of G is a clopen subset of X2 without the diagonal. We study clopen graphs on Polish spaces in terms of their finite induced subgraphs and obtain information about their cochromatic numbers. In this context we investigate modular profinite graphs, a class of graphs obtained from finite graphs by taking inve...

Let G be a graph of order n with an edge coloring c, and let δ(G) denote the minimum color degree of G, i.e., the largest integer such that each vertex of G is incident with at least δ(G) edges having pairwise distinct colors. A subgraph F ⊂ G is rainbow if all edges of F have pairwise distinct colors. In this paper, we prove that (i) if G is triangle-free and δ(G) > n3 + 1, then G contains a r...

We compare the infrared colors predicted by theoretical models of protostellar envelopes and protoplanetary disks with initial observations of young stellar objects made with the Infrared Array Camera ( IRAC) on the Spitzer Space Telescope. Disk and envelope models characterized by infall and/or accretion rates found in previous studies can quantitatively account for the range of IRAC colors fo...