𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity

✍ Scribed by Zhiquan Hu

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
591 KB
Volume
196
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a 2-connected graph with n vertices and H be an induced subgraph of G. Denote 6 := {u E V(G): d(o) > n/2}. If there exists a pair of vertices x and y at distance 2 in H such that {x, y} c V(H)\K, then H is called degree light. Let F be the unique graph with degree sequence (1, 1,1,3,3,3). In this paper, we prove that if G contains no degree light K1.3 and every degree light F of G contains no induced fi of G -6, then G is hamiltonian.

πŸ“œ SIMILAR VOLUMES

A generalization of Fan's condition for
A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
✍ P. Bedrossian; G. Chen; R.H. Schelp πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 770 KB

Bedrossian, P., G. Chen and R.H. &help, A generalization of Fan's condition of Hamiltonicity, pancyclicity, and Hamiltonian connectedness, Discrete Mathematics 115 (1993) 39-50. A weakened version of Fan's condition for Hamiltonicity is shown to be sufficient for a 2-connected graph to be pancyclic

Generalization of convergence conditions
Generalization of convergence conditions for a restarted GMRES
✍ Jan ZΓ­tko πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 106 KB πŸ‘ 2 views

We consider the GMRES(s), i.e. the restarted GMRES with restart s for the solution of linear systems Ax = b with complex coefficient matrices. It is well known that the GMRES(s) applied on a real system is convergent if the symmetric part of the matrix A is positive definite. This paper introduces s