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.
| Main Authors: | , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Dalat University
2024-02-01
|
| 丛编: | Tạp chí Khoa học Đại học Đà Lạt |
| 主题: | |
| 在线阅读: | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036 |