𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Search for an upper bound for the number of constituent quarks from e+e−annihilation

✍ Scribed by V. Roberto; C. Verzegnassi

Book ID
112889716
Publisher
Società Italiana di Fisica
Year
1981
Weight
315 KB
Volume
31
Category
Article
ISSN
0375-930X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the k-domination numb
An upper bound for the k-domination number of a graph
✍ E. J. Cockayne; B. Gamble; B. Shepherd 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

The kdomination number of a graph G, y k ( G ) , is the least cardinality of a set U of verticies such that any other vertex is adjacent to at least k vertices of U. We prove that if each vertex has degree at least k. then YAG) 5 kp/(k + 1).

New upper bounds for the greatest number
New upper bounds for the greatest number of proper colorings of a (V,E)-graph
✍ Felix Lazebnik 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract Let 𝒻 denote the family of simple undirected graphs on __v__ vertices having __e__ edges ((__v__, __e__)‐graphs) and __P__(__G__; λ) be the chromatic polynomial of a graph __G.__ For the given integers __v__, __e__, and λ, let __f__(__v__, __e__, λ) denote the greatest number of proper