This Paper aims at classification of flower images by means of Gist descriptor and statistical features using SVM classifier. With advances in digital image processing, automated classification of flower images over large categories of dataset is possible by knowing the name of the flower. In case of unknown species name, classification of flower image can be performed by its visual content. Th...

We compared microsporogenesis and flower development in Eucalyptus urophylla × E. tereticornis. In this study, although microsporogenesis and cytokinesis occurred simultaneously during meiosis of pollen mother cells, we observed a strong asynchronism in different anthers from a flower bud. The developmental period of microsporogenesis in anthers originated from the long thrum before the short t...

‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

With each coassociative coalgebra, we associate an oriented graph. The coproduct ∆, obeying the coassociativity equation (∆ ⊗ id)∆ = (id ⊗ ∆)∆ is then viewed as a physical propagator which can convey information. We notice that such a coproduct is non local. To recover locality we have to break the coassociativity of the coproduct and restore it, in some sense by introducing another coproduct ∆̃...

Flowers of Nelumbo nucifera Gaertn, Hibiscus rosa-sinensis L., Calendula officinalis L., Datura metel L., Jasminum sambac L Aiton., Mimusops elengi L., Nyctanthes arbor-tristis L., Saraca asoca (Roxb.) Wilde., Tabernaemontana divaricata (L.) R. Br. ex Roemer and Schultes., and Ixora coccinea L. are very popular for their aesthetic and spiritual appeal. Indigenous treatment systems found these f...

the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

As first noted by Aristotle in honeybee workers, many insect pollinators show a preference to visit flowers of just one species during a foraging trip. This "flower constancy" probably benefits plants, because pollen is more likely to be deposited on conspecific stigmas. But it is less clear why insects should ignore rewarding alternative flowers. Many researchers have argued that flower consta...