✦ LIBER ✦

unit sediment graph

✍ Scribed by Rendon-Herrero, Oswald

Book ID: 119736492
Publisher: American Geophysical Union
Year: 1978
Tongue: English
Weight: 690 KB
Volume: 14
Category: Article
ISSN: 0043-1397
DOI: 10.1029/wr014i005p00889

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Instantaneous-Unit Sediment Graph

✍ Kumar, Arun; Devi, Rema 📂 Article 📅 1995 🏛 American Society of Civil Engineers 🌐 English ⚖ 87 KB

A sediment graph model based on an insta

A sediment graph model based on an instantaneous unit sediment graph

✍ Williams, J. R. 📂 Article 📅 1978 🏛 American Geophysical Union 🌐 English ⚖ 469 KB

Prediction of sediment yield by coupling

Prediction of sediment yield by coupling Kalman filter with instantaneous unit sediment graph

✍ Y. H. Lee; V. P. Singh 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

An instantaneous unit sediment graph (IUSG) model in conjunction with Kalman ®lter was investigated for prediction of sediment yield from an upland watershed in Northwestern Mississippi. The state vector of the watershed sediment yield system was constituted by the IUSG and then the sediment yield w

THE GRAPH OF THE UNIT PARABOLA

✍ J. R. Sage Jr. 📂 Article 📅 1918 🏛 School Science and Mathematics Association 🌐 English ⚖ 124 KB

Unit disk graphs

✍ Brent N. Clark; Charles J. Colbourn; David S. Johnson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 878 KB

Subdividing a Graph Toward a Unit-distan

Subdividing a Graph Toward a Unit-distance Graph in the Plane

✍ Severino V. Gervacio; Hiroshi Maehara 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 150 KB

The subdivision number of a graph G is defined to be the minimum number of extra vertices inserted into the edges of G to make it isomorphic to a unit-distance graph in the plane. Let t (n) denote the maximum number of edges of a C 4 -free graph on n vertices. It is proved that the subdivision numbe