CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH

Let G be an undirected simple graph on \(n \geq 3\) vertices with the degree sum of any two nonadjacent vertices in G equal to \(n - 2\). We determine the condition for G to be a Hamiltonian graph.

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Prif Awduron: Do, Nhu An, Nguyen, Quang Tuan
Fformat: Erthygl
Iaith:English
Cyhoeddwyd: Trường Đại học Đà Lạt 2024
Pynciau:
Mynediad Ar-lein:https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/256904
https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
Thư viện lưu trữ: Thư viện Trường Đại học Đà Lạt

Eitemau Tebyg