𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Upper Bound on the Average Size of Silhouettes

✍ Scribed by M. Glisse; S. Lazard

Publisher
Springer
Year
2008
Tongue
English
Weight
619 KB
Volume
40
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Upper bound on number average molecular
Upper bound on number average molecular weight of asphaltenes
✍ David A. Storm; Stephen J. DeCanio; Maureen M. DeTar; Vincent P. Nero πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 484 KB

An upper bound on the number average molecular weight of a molecular mixture is derived in terms of quantities measured in mass spectrometry. The upper bound is useful for samples that do not completely sublime, such as the less soluble subfractions of vacuum residue. Using the upper bound it is sho

An upper bound on the size of the larges
An upper bound on the size of the largest cliques in a graph
✍ Alain Billionnet πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 194 KB πŸ‘ 1 views

## Abstract We produce in this paper an upper bound for the number of vertices existing in a clique of maximum cardinal. The proof is based in particular on the existence of a maximum cardinal clique that contains no vertex __x__ such that the neighborhood of __x__ is contained in the neighborhood

An upper bound on the size of a largest
An upper bound on the size of a largest clique in a graph
✍ Dennis P. Geoffroy; David P. Sumner πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 308 KB πŸ‘ 1 views

## Abstract A graph is point determining if distinct vertices have distinct neighborhoods. The nucleus of a point‐determining graph is the set __G__^O^ of all vertices, __v__, such that __G__–__v__ is point determining. In this paper we show that the size, Ο‰(__G__), of a maximum clique in __G__ sat