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.
Kaydedildi:
Asıl Yazarlar: | Do, Nhu An, Nguyen, Quang Tuan |
---|---|
Materyal Türü: | Makale |
Dil: | English |
Baskı/Yayın Bilgisi: |
Trường Đại học Đà Lạt
2024
|
Konular: | |
Online Erişim: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/256904 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036 |
Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Benzer Materyaller
-
4-Regular graph of diameter 2 /
Yazar:: Do Nhu An. -
4-Regular graph of diameter 2
Yazar:: Đỗ, Như An, ve diğerleri
Baskı/Yayın Bilgisi: (2012) -
4-regular graph of diameter 2
Yazar:: Do, Nhu An, ve diğerleri
Baskı/Yayın Bilgisi: (2014) -
Degree prime graph /
Yazar:: Sattanathan, M. -
Planarity of joined graphs /
Yazar:: Sitthiwiratham, T.