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: | Nhu An Do, Quang Tuan Nguyen |
---|---|
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!
|
Similar Items
-
THE STRUCTURE OF GRAPHS ON \(n\) VERTICES WITH THE DEGREE SUM OF ANY TWO NONADJACENT VERTICES EQUAL TO \(n-2\)
by: Do Nhu An
Published: (2021-10-01) -
4-REGULAR GRAPH OF DIAMETER 2
by: Đỗ Như An, et al.
Published: (2013-06-01) -
A note on the problem of finding a (3,9)-cage
by: P. K. Wong
Published: (1985-01-01) -
Hamiltonian-connected graphs and their strong closures
by: Pak-Ken Wong
Published: (1997-01-01) -
Homomorphisms of complete n-partite graphs
by: Robert D. Girse
Published: (1986-01-01)