ISSN:
1435-5914
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract For a graphG, letσ 3 = min{∑ i=1 3 d(ui): {u1, u2, u3} is an independent set ofG} and $$\bar \sigma _3 $$ = min{∑ i=1 3 d(ui) − $$| \cap _{i = 1}^3 N(u_i )|: \{ u_1 ,u_2 ,u_3 \} $$ is an independent set ofG}. In this paper, we shall prove the following result: LetG be a 1-tough graph withn vertices such thatσ 3 ≥ n and $$\bar \sigma _3 $$ − 4. ThenG is hamiltonian. This generalizes a result of Fassbender [2], a result of Flandrin, Jung and Li [3] and a result of Jung [5].
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01858471
Permalink