𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructal tree-shaped paths for conduction and convection

✍ Scribed by Adrian Bejan

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
249 KB
Volume
27
Category
Article
ISSN
0363-907X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Constructal tree-shaped two-phase flow f
Constructal tree-shaped two-phase flow for cooling a surface
✍ C. Zamfirescu; A. Bejan πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 299 KB

This paper documents the strong relation that exists between the changing architecture of a complex flow system and the maximization of global performance under constraints. The system is a surface with uniform heating per unit area, which is cooled by a network with evaporating two-phase flow. Illu

Backbone colorings for graphs: Tree and
Backbone colorings for graphs: Tree and path backbones
✍ Hajo Broersma; Fedor V. Fomin; Petr A. Golovach; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 158 KB

## Abstract We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph __G__ = (__V__,__E__) and a spanning subgraph __H__ of __G__ (the backbone of __G__), a backbone coloring for __G__ and __H__ is a proper vertex coloring __V__ → {1,2,…} of __G__ in which

Constructive characterizations for packi
Constructive characterizations for packing and covering with trees
✍ AndrΓ‘s Frank; LΓ‘szlΓ³ SzegΕ‘ πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 342 KB

We give a constructive characterization of undirected graphs which contain k spanning trees after adding any new edge. This is a generalization of a theorem of Henneberg and Laman who gave the characterization for k = 2. We also give a constructive characterization of graphs which have k edge-disjoi