𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the minimum order of graphs with given semigroup

✍ Scribed by Václav Koubek; Vojtěch Rödl

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
1013 KB
Volume
36
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the independent domination number of
On the independent domination number of graphs with given minimum degree
✍ N.I. Glebov; A.V. Kostochka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 175 KB

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case 6 = 2 of the corresponding conjecture by Favaron (1988). @ 1998 Elsevier Science B.V. A

The number of cutvertices in graphs with
The number of cutvertices in graphs with given minimum degree
✍ L.H. Clark; R.C. Entringer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 453 KB

The maximum number of cutvertices in a connected graph of order n having minimum degree at least 6 is determined for 6 > 5.