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.
में बचाया:
मुख्य लेखकों: | , |
---|---|
स्वरूप: | लेख |
भाषा: | English |
प्रकाशित: |
Trường Đại học Đà Lạt
2024
|
विषय: | |
ऑनलाइन पहुंच: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/256904 https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036 |
टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|