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: | Do, Nhu An, Nguyen, Quang Tuan |
---|---|
Format: | Bài viết |
Sprog: | English |
Udgivet: |
Trường Đại học Đà Lạt
2024
|
Fag: | |
Online adgang: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/256904 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036 |
Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Lignende værker
-
4-Regular graph of diameter 2 /
af: Do Nhu An. -
4-Regular graph of diameter 2
af: Đỗ, Như An, et al.
Udgivet: (2012) -
4-regular graph of diameter 2
af: Do, Nhu An, et al.
Udgivet: (2014) -
Degree prime graph /
af: Sattanathan, M. -
Planarity of joined graphs /
af: Sitthiwiratham, T.