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:
Bibliographic Details
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!