𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Flat pencils of symplectic connections and Hamiltonian operators of degree 2

✍ Scribed by James T. Ferguson

Book ID
108137787
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
374 KB
Volume
58
Category
Article
ISSN
0393-0440

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Short Proof of a Theorem Concerning De
A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs
✍ Bing Wei πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 74 KB

proved that if G is a 2-connected graph with n vertices such that d(u)+d(v)+d(w) n+} holds for any triple of independent vertices u, v, and w, then G is hamiltonian, where } is the vertex connectivity of G. In this note, we will give a short proof of the above result.