𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalization of Kleene's theorem and nondeterministic structured programming

✍ Scribed by Valeriu Breazu; Octavian Stânâşilâ


Book ID
114037555
Publisher
Elsevier Science
Year
1981
Weight
314 KB
Volume
51
Category
Article
ISSN
0019-9958

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Neighborhood unions and a generalization
✍ R.J. Faudree; R.J. Gould; M.S. Jacobson; L.M. Lesniak 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 818 KB

Dirac proved that if each vertex of a graph G of order n 23 has degree at least n/2, then the graph is Hamiltonian. This result will be generalized by showing that if the union of the neighborhoods of each pair of vertices of a 2connected graph G of sufficiently large order n has at least n/2 vertic