One sufficient condition for hamiltonian graphs

JOURNAL ARTICLE

Year: 1990 Journal: Journal of Graph Theory Vol: 14 (4)Pages: 501-508 Publisher: Wiley

DOI: 10.1002/jgt.3190140414

Abstract

Abstract Let G be a 2‐connected graph of order n. We show that if for each pair of nonadjacent vertices x , y ∈ V(G) , then G is Hamiltonian.

Keywords:

Mathematics Combinatorics Hamiltonian path Hamiltonian (control theory) Discrete mathematics Indifference graph Graph Mathematical optimization

Cited By

0.97

FWCI (Field Weighted Citation Impact)

Refs

0.74

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics