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.
Đã lưu trong:
| Những tác giả chính: | , |
|---|---|
| Định dạng: | Bài viết |
| Ngôn ngữ: | English |
| Được phát hành: |
Trường Đại học Đà Lạt
2024
|
| Những chủ đề: | |
| Truy cập trực tuyến: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/256904 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036 |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| id |
oai:scholar.dlu.edu.vn:DLU123456789-256904 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scholar.dlu.edu.vn:DLU123456789-2569042024-12-29T01:13:07Z 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 Do, Nhu An Nguyen, Quang Tuan Connected graph Hamiltonian graph Independent set Regular graph t-tough 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. 2024-12-29T00:39:20Z 2024-12-29T00:39:20Z 2024 Article 0866-787X https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/256904 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036 10.37569/DalatUniversity.14.3.1036(2024) en Dalat University Journal of Science, Volume 14, Issue 3; p.45599 application/pdf Trường Đại học Đà Lạt |
| institution |
Thư viện Trường Đại học Đà Lạt |
| collection |
Thư viện số |
| language |
English |
| topic |
Connected graph Hamiltonian graph Independent set Regular graph t-tough graph |
| spellingShingle |
Connected graph Hamiltonian graph Independent set Regular graph t-tough graph Do, Nhu An Nguyen, Quang Tuan 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 |
| description |
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. |
| format |
Article |
| author |
Do, Nhu An Nguyen, Quang Tuan |
| author_facet |
Do, Nhu An Nguyen, Quang Tuan |
| author_sort |
Do, Nhu An |
| title |
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 |
| title_short |
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 |
| title_full |
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 |
| title_fullStr |
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 |
| title_full_unstemmed |
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 |
| title_sort |
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 |
| publisher |
Trường Đại học Đà Lạt |
| publishDate |
2024 |
| url |
https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/256904 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036 |
| _version_ |
1819782116278272000 |