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.
Na minha lista:
Những tác giả chính: | Do, Nhu An, Nguyen, Quang Tuan |
---|---|
Formato: | Artigo |
Idioma: | English |
Publicado em: |
Trường Đại học Đà Lạt
2024
|
Assuntos: | |
Acesso em linha: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/256904 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036 |
Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Registos relacionados
-
4-Regular graph of diameter 2 /
Por: Do Nhu An. -
4-Regular graph of diameter 2
Por: Đỗ, Như An, et al.
Publicado em: (2012) -
4-regular graph of diameter 2
Por: Do, Nhu An, et al.
Publicado em: (2014) -
Degree prime graph /
Por: Sattanathan, M. -
Planarity of joined graphs /
Por: Sitthiwiratham, T.