Bounds for the Independence Number in $k$-Step Hamiltonian Graphs

Bounds for the Independence Number in $k$-Step Hamiltonian Graphs

For a given integer $k$, a graph $G$ of order $n$ is called $k$-step Hamiltonian if there is a labeling $v_1,v_2,...,v_n$ of vertices of $G$ such that $d(v_1,v_n)=d(v_i,v_{i+1})=k$ for $i=1,2,...,n-1$. The independence number of a graph is the maximum cardinality of a subset of pair-wise non-adj...

Full description

Bibliographic Details
Main Authors: Noor A'lawiah Abd Aziz, Nader Jafari Rad, Hailiza Kamarulhaili, Roslan Hasni
Format: Article
Language:English
Published: Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova 2018-05-01
Series:Computer Science Journal of Moldova
Subjects:
Independence number
Hamiltonian graph
Online Access:http://www.math.md/files/csjm/v26-n1/v26-n1-(pp15-28).pdf

Internet

http://www.math.md/files/csjm/v26-n1/v26-n1-(pp15-28).pdf

Similar Items