On Hamilton cycles in locally connected graphs with vertex degree constraints

It is shown that every connected, locally connected graph with the maximum vertex degree Δ(G)=5 and the minimum vertex degree δ(G)3 is fully cycle extendable. For Δ(G)4, all connected, locally connected graphs, including infinite ones, are explicitly described. The Hamilton Cycle problem for locally connected graphs with Δ(G)7 is shown to be NP-complete

The dependence of power consumption of pneumatic conveying systems upon bulk material properties, pipeline bore and routing, and mode of flow

In this paper the dependence of the power consumption of pneumatic conveyors upon conveyed materials, pipeline route and bore, and mode of flow has been examined. The findings are that, with different materials and modes of flow, not only is the amount of power consumed very different but it varies in different ways with pipe bore and routing. Additionally it has been found that, for any given conveying system, the choice of air mover also has a strong influence on the power requirement.