Abstract The Heliconia species with pendent inflorescences and colorful bracts are a good option as cut flower for floriculture market, but only few of this type eg. H. rostrata, rauliniana chartacea commercially produced in Brazil. This study was carried out to characterize 36 accessions, inflorescences, be used flower, intending increase knowledge use these exceptional plants among tropical e...

The square of a graph G, denoted G, is obtained from G by putting an edge between two distinct vertices whenever their distance is two. Then G is called a square root of G. Deciding whether a given graph has a square root is known to be NP-complete, even if the root is required to be a chordal graph or even a split graph. We present a polynomial time algorithm that decides whether a given graph...

Let G = (V,E) be a graph of order p and size q having no isolated vertices. A bijection f : V → {1, 2, 3, ..., p} is called local edge antimagic labeling if for any two adjacent edges e uv e’ vw G, we have w(e) ≠ w(e’), where the weight w(e uv) f(u)+f(v) w(e’) f(v)+f(w). has labeling. The chromatic number χ’lea(G) defined to minimum colors taken over all colorings induced by labelings G. In thi...

We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to find an odd sun when the method fails. This algorithm has several interesting consequences concerning the relationship between path graphs and directed path graphs. One is that for a directed path graph, path graph mode...

An efficiently total dominating set of a graph G is a subset of its vertices such that each vertex of G is adjacent to exactly one vertex of the subset. If there is such a subset, then G is an efficiently total dominable graph (G is etd). In this paper, we prove NP-completeness of the etd decision problem on the class of planar bipartite graphs of maximum degree 3. Furthermore, we give an effic...

The effect of different cutting fluids on surface roughness brass alloy workpiece during turning operation was carried out in this research. This performed with speed, while other parameters had been regarded as constants(feeding rate , and depth cut). Surface machined parts that will be tested by electronic tester .The results show the standard coolant gives best values for fixed speed ,follow...

The Java HotSpotTM server compiler of Sun Microsystems uses intermediate graph data structures when compiling Java bytecodes to machine code. The graphs are program dependence graphs, which model both data and control dependencies. For debugging, there are built-in tracing mechanisms that output a textual representation of the graphs to the command line. This thesis presents a tool which displa...