✦ LIBER ✦

The curl of graphs and networks

✍ Scribed by Karl Gustafson; Frank Harary

Publisher: Elsevier Science
Year: 1985
Weight: 775 KB
Volume: 6
Category: Article
ISSN: 0270-0255
DOI: 10.1016/0270-0255(85)90005-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs and networks

✍ J.V. Oldfield 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 337 KB

The concepts and application of graph theory to practical problems involving networks are discussed. Examples are given from digital system design.

Matrix operations and the properties of

Matrix operations and the properties of networks and directed graphs

✍ Edmund R. Peay 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 691 KB

Uncountable transfinite graphs and elect

Uncountable transfinite graphs and electrical networks

✍ A. H. Zemanian 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 816 KB

Balanced graphs and network flows

✍ Penrice, Stephen G. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB

A graph G is balanced if the maximum ratio of edges to vertices, taken over all subgraphs of G, occurs at G itself. This note uses the max-flow/min-cut theorem to prove a good characterization of balanced graphs. This characterization is then applied to some results on how balanced graphs may be com

Edge-packing of graphs and network relia

Edge-packing of graphs and network reliability

✍ Charles J. Colbourn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 842 KB

The reliability of a network can be efficiently bounded using graph-theoretical techniques based on edge-packing. We examine the application of combinatorial theorems on edgepacking spanning trees, s, t-paths, and s, t-cuts to the determination of reliability bounds. The application of spanning tree

On the curl of desiccation polygons

✍ J.R.L. Allen 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 424 KB