Bounds for the independence number in \(k\)-step Hamiltonian graphs
From MaRDI portal
Publication:1650405
zbMath1390.05155MaRDI QIDQ1650405
Hailiza Kamarulhaili, Noor A'lawiah Abd Aziz, Nader Jafari Rad, Roslan Hasni
Publication date: 3 July 2018
Published in: Computer Science Journal of Moldova (Search for Journal in Brave)
Full work available at URL: http://www.math.md/publications/csjm/issues/v26-n1/12564/
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
This page was built for publication: Bounds for the independence number in \(k\)-step Hamiltonian graphs