𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bound for the degree of an approximating monomial

✍ Scribed by Sayel A Ali

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
929 KB
Volume
59
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An upper bound for the diameter of a pol
An upper bound for the diameter of a polytope
✍ David Barnette πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 515 KB

The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d

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 total colouring of gr
An upper bound for total colouring of graphs
✍ Colin J.H. McDiarmid; AbdΓ³n SΓ‘nchez-Arroyo πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 235 KB

An upper bound for total colouring of graphs, Discrete Mathematics 111 (1993) 3899392. We give an upper bound on the number of colours required to extend a given vertex colouring of a graph to a total colouring. This shows that for any simple graph there is a total colouring using at most :d + 3 co