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.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Trường Đại học Đà Lạt
2024
|
| Subjects: | |
| Online Access: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/256904 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institutions: | Thư viện Trường Đại học Đà Lạt |
|---|