We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of these paths is small. We prove that d 2 e edge slopes suffice for outerplanar drawings of outerplanar graphs with maximum degree ∆ > 3. This matches the obvious lower bound. We also show that d 2 e + 1 edge slopes suffice ...

Many studies have been conducted on the characteristics of hydraulic jumps over horizontal basins. On sloping basins, however, few such studies have been performed so that the issue requires more investigation. A significant number of studies has also been conducted on basins with positive slopes but comparatively few have been carried out on basins with negative slopes. This study was carried ...

We examine whether credit-spread curves, engendered by a mandatory subordinated-debt requirement for banks, would help predict bank risk. We extract the credit-spread curves each quarter for each bank in our sample, and analyze the information content of credit-spread slopes. We find that credit-spread slopes are significant predictors of future credit spreads. However, credit-spread slopes do ...

this paper presents an analytical model characterizing unsteady groundwater flow in an unconfined aquifer resting on a sloping impervious bed. the aquifer is in contact with a constant water level at one end. the other end is connected to a stream whose level is increasing form an initial level to a final level at a known exponentially decaying function of time. moreover, the aquifer is repleni...

We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane drawing ...