Four sufficient conditions for hamiltonian graphs
نویسندگان
چکیده
منابع مشابه
Necessary and Sufficient Conditions for Unit Graphs to Be Hamiltonian
A graph is Hamiltonian if it has a cycle that visits every vertex exactly once; such a cycle is called a Hamiltonian cycle. In general, the problem of finding a Hamiltonian cycle in a given graph is an NP-complete problem and a special case of the traveling salesman problem. It is a problem in combinatorial optimization studied in operations research and theoretical computer science; see [Garey...
متن کاملNew sufficient conditions for hamiltonian and pancyclic graphs
For a graph G of order n we consider the unique partition of its vertex set V (G) = A ∪ B with A = {v ∈ V (G) : d(v) ≥ n/2} and B = {v ∈ V (G) : d(v) < n/2}. Imposing conditions on the vertices of the set B we obtain new sufficient conditions for hamiltonian and pancyclic graphs.
متن کاملExtension of several sufficient conditions for Hamiltonian graphs
Let G be a 2-connected graph of order n. Suppose that for all 3-independent sets X in G, there exists a vertex u in X such that |N(X\{u})| + d(u) ≥ n − 1. Using the concept of dual closure, we prove that 1. G is hamiltonian if and only if its 0-dual closure is either complete or the cycle C7 2. G is nonhamiltonian if and only if its 0-dual closure is either the graph (Kr ∪ Ks ∪ Kt) ∨ K2, 1 ≤ r ...
متن کاملNew Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs
A graph G is s-Hamiltonian if for any S ⊆ V (G) of order at most s, G−S has a Hamiltonian-cycle, and s-Hamiltonian connected if for any S ⊆ V (G) of order at most s, G − S is Hamiltonian-connected. Let k > 0, s ≥ 0 be two integers. The following are proved in this paper: (1) Let k ≥ s+ 2 and s ≤ n− 3. If G is a k-connected graph of order n and if max{d(v) : v ∈ I} ≥ (n+s)/2 for every independen...
متن کاملNew sufficient condition for Hamiltonian graphs
Let G be a graph and α(G) be the independence number of G. For a vertex v ∈ V (G), d(v) and N(v) represent the degree of v and the neighborhood of v in G, respectively. In this paper, we prove that if G is a k-connected graph of order n, and if max{d(v) : v ∈ S} ≥ n/2 for every independent set S of G with |S| = k which has two distinct vertices x, y ∈ S satisfying 1 ≤ |N(x) ∩N(y)| ≤ α(G)− 1, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90367-b