𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An upper bound for the complexity of transformation semigroups

✍ Scribed by Stuart W Margolis; Bret Tilson

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
759 KB
Volume
73
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A probabilistic upper bound for the edge
A probabilistic upper bound for the edge identification complexity of graphs
✍ Eberhard Triesch πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 344 KB

Given a finite graph G=( V, E), what is the minimum number c(G) of incidence tests which are needed in the worst case to identify an unknown edge e\*EE? The number c(G) was first studied by Aigner and Triesch (1988), where it was shown that for almost all graphs in the random graph model where d(n)

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.