✦ LIBER ✦

A fixed upper bound on the number of layers in optimal composite sheets

✍ Scribed by J.J. McKeown

Book ID: 103129234
Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 465 KB
Volume: 14
Category: Article
ISSN: 0020-7683
DOI: 10.1016/0020-7683(78)90047-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some Upper Bounds on the Redundancy of O

Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes

✍ Khosravifard, M.; Kheradmand, S. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 410 KB

The upper bound of the optimal number of

The upper bound of the optimal number of clusters in fuzzy clustering

✍ Jian Yu; Qiansheng Cheng 📂 Article 📅 2001 🏛 Science in China Press (SCP) 🌐 English ⚖ 473 KB

A procedure for finding an improved uppe

A procedure for finding an improved upper bound on the number of optimal design points

✍ Seung Won Hyun; Min Yang; Nancy Flournoy 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 342 KB

An upper bound on the number of cliques

An upper bound on the number of cliques in a graph

✍ Martin Farber; Mihály Hujter; Zsolt Tuza 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 1 views

An upper bound on the path number of a d

An upper bound on the path number of a digraph

✍ Richard C O'Brien 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 431 KB

A New Upper Bound on the Cheeger Number

A New Upper Bound on the Cheeger Number of a Graph

✍ Sorin Dragomir; Elisabetta Barletta 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Using a technique developed by A. Nilli (1991, Discrete Math. 91, 207 210), we estimate from above the Cheeger number of a finite connected graph G of small degree (2(G) 5) admitting sufficiently distant edges. ## 2001 Academic Press Let G=(V(G), E(G)) be a finite connected graph. The Cheeger numb