Investigating the representation of merging behavior at the floor–stair interface in computer simulations of multi-floor building evacuations

In this article, the representation of the merging process at the floor— stair interface is examined within a comprehensive evacuation model and trends found in experimental data are compared with model predictions. The analysis suggests that the representation of floor—stair merging within the comprehensive model appears to be consistent with trends observed within several published experiments of the merging process. In particular: (a) The floor flow rate onto the stairs decreases as the stair population density increases. (b) For a given stair population density, the floor population's flow rate onto the stairs can be maximized by connecting the floor to the landing adjacent to the incoming stair. (c) In situations where the floor is connected adjacent to the incoming stair, the merging process appears to be biased in favor of the floor population. It is further conjectured that when the floor is connected opposite the incoming stair, the merging process between the stair and floor streams is almost in balance for high stair population densities, with a slight bias in favor of the floor stream at low population densities. A key practical finding of this analysis is that the speed at which a floor can be emptied onto a stair can be enhanced simply by connecting the floor to the landing at a location adjacent to the incoming stair rather than opposite the stair. Configuring the stair in this way, while reducing the floor emptying time, results in a corresponding decrease in the descent flow rate of those already on the stairs. While this is expected to have a negligible impact on the overall time to evacuate the building, the evacuation time for those higher up in the building is extended while those on the lower flows is reduced. It is thus suggested that in high-rise buildings, floors should be connected to the landing on the opposite side to the incoming stair. Information of this type will allow engineers to better design stair—floor interfaces to meet specific design objectives.

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