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.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Dalat University
2024-02-01
|
| Series: | Tạp chí Khoa học Đại học Đà Lạt |
| Subjects: | |
| Online Access: | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1823857101322059776 |
|---|---|
| author | Nhu An Do Quang Tuan Nguyen |
| author_facet | Nhu An Do Quang Tuan Nguyen |
| author_sort | Nhu An Do |
| collection | DOAJ |
| description |
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.
|
| format | Article |
| id | doaj-art-ed4ab2ddb6464be1a7a3e8b23486946b |
| institution | Kabale University |
| issn | 0866-787X |
| language | English |
| publishDate | 2024-02-01 |
| publisher | Dalat University |
| record_format | Article |
| series | Tạp chí Khoa học Đại học Đà Lạt |
| spelling | doaj-art-ed4ab2ddb6464be1a7a3e8b23486946b2025-02-12T01:01:01ZengDalat UniversityTạp chí Khoa học Đại học Đà Lạt0866-787X2024-02-0114310.37569/DalatUniversity.14.3.1036(2024)1091CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPHNhu An Do0https://orcid.org/0000-0002-0154-8954Quang Tuan Nguyen1https://orcid.org/0009-0008-9513-0743Nha Trang UniversityNha Trang University 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. https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036Connected graphHamiltonian graphIndependent setRegular grapht-tough graph. |
| spellingShingle | Nhu An Do Quang Tuan Nguyen 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 Tạp chí Khoa học Đại học Đà Lạt Connected graph Hamiltonian graph Independent set Regular graph t-tough graph. |
| title | 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 |
| title_full | 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 |
| title_fullStr | 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 |
| title_full_unstemmed | 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 |
| title_short | 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 |
| title_sort | 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 |
| topic | Connected graph Hamiltonian graph Independent set Regular graph t-tough graph. |
| url | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/1036 |
| work_keys_str_mv | AT nhuando conditionsforgraphsonnverticeswiththesumofdegreesofanytwononadjacentverticesequalton2tobeahamiltoniangraph AT quangtuannguyen conditionsforgraphsonnverticeswiththesumofdegreesofanytwononadjacentverticesequalton2tobeahamiltoniangraph |