Some properties of k-step Hamiltonian graphs

Some properties of k-step Hamiltonian graphs

A graph G with n vertices is called a k–step Hamiltonian graph if the n vertices can be labeled as the sequence υ1, υ2,…,υn such that d(υi, υi+1) = d(υ1, υn) = k for each i = 1,2,…, n − 1. In this paper, we continue the study of k–step Hamiltonian graphs and obtain several properties....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Aziz, Noor A’lawiah Abd, Rad, Nader Jafari, Kamarulhaili, Hailiza, Hasni, Roslan
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Apexes
Graph theory
Graphs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A graph G with n vertices is called a k–step Hamiltonian graph if the n vertices can be labeled as the sequence υ1, υ2,…,υn such that d(υi, υi+1) = d(υ1, υn) = k for each i = 1,2,…, n − 1. In this paper, we continue the study of k–step Hamiltonian graphs and obtain several properties.
ISSN:0094-243X
1551-7616
DOI:10.1063/1.5136366