✦ LIBER ✦

An upper bound for the average number of regions

✍ Scribed by Saul Stahl

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 190 KB
Volume: 52
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(91)90063-p

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 for the Independent Domin

An Upper Bound for the Independent Domination Number

✍ Liang Sun; Jianfang Wang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 87 KB

Let G be a simple graph of order n and minimum degree $. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. In this paper, we show that i(G) n+2$&2 -n$. Thus a conjecture of Favaron is settled in the affirmative.

An upper bound for some ramsey numbers

✍ Andrew Thomason 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB 👁 1 views

New upper bounds for the ramsey numbers r ( k , I ) are obtained. In particular it is shown there is a constant A such that The ramsey number r(k, l ) is the smallest integer n, such that any coloring with red and blue of the edges of the complete graph K , of order n yields either a red K , subgra

An upper bound for the path number of a

An upper bound for the path number of a graph

✍ Alan Donald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ Lovász has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≤ 1/2 __u__ + __g__ ‐ 1 ≤ __n__ ‐ 1, where __n__ is the total numbe

An upper bound for the ramsey number M(5

An upper bound for the ramsey number M(5, 4)

✍ K Walker 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 498 KB

An upper bound for the harmonious chroma

An upper bound for the harmonious chromatic number of a graph

✍ Sin-Min Lee; John Mitchem 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o