A Note on k-Step Hamiltonian Graphs

被引:0
作者
Abd Aziz, N. A. [1 ]
Rad, N. J. [2 ]
Kamarulhaili, H. [1 ]
Hasni, R. [3 ]
机构
[1] Univ Sains Malaysia, Sch Math Sci, George Town, Malaysia
[2] Shahed Univ, Dept Math, Tehran, Iran
[3] Univ Malaysia Terengganu, Sch Informat & Appl Math, Kuala Terengganu, Terengganu, Malaysia
来源
MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES | 2019年 / 13卷 / 01期
关键词
Hamiltonian graph; k-Step Hamiltonian graph;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For a given integer k, a given graph G on n vertices is called k-step Hamiltonian (or just k-SH) if the vertices of G can be labeled as v(1), v(2), ..., v(n) such that d(v(i), v(i+1)) = k and d(v(i),v(i+1)) = k for each i = 1, 2, ..., n - 1. In this paper, we present a construction namely B-construction that produces a (k+i)-SH graph from any k-SH graph G for every positive integer i >= 1.
引用
收藏
页码:87 / 93
页数:7
相关论文
共 50 条
  • [31] Sufficient spectral conditions on Hamiltonian and traceable graphs
    Liu, Ruifang
    Shiu, Wai Chee
    Xue, Jie
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 467 : 254 - 266
  • [32] The largest eigenvalue conditions for Hamiltonian and traceable graphs
    Li, Rao
    DISCRETE MATHEMATICS LETTERS, 2023, 12 : 50 - 53
  • [33] NECESSARY AND SUFFICIENT CONDITIONS FOR UNIT GRAPHS TO BE HAMILTONIAN
    Maimani, H. R.
    Pournaki, M. R.
    Yassemi, S.
    PACIFIC JOURNAL OF MATHEMATICS, 2011, 249 (02) : 419 - 429
  • [34] On 3-connected hamiltonian line graphs
    Chen, Ye
    Fan, Suohai
    Lai, Hong-Jian
    DISCRETE MATHEMATICS, 2012, 312 (11) : 1877 - 1882
  • [35] Bounds on Signless Laplacian Eigenvalues of Hamiltonian Graphs
    Milica Anđelić
    Tamara Koledin
    Zoran Stanić
    Bulletin of the Brazilian Mathematical Society, New Series, 2021, 52 : 467 - 476
  • [36] HAMILTONIAN AND PANCYCLIC GRAPHS IN THE CLASS OF SELF-CENTERED GRAPHS WITH RADIUS TWO
    Hrnciar, Pavel
    Monoszova, Gabriela
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (03) : 661 - 681
  • [37] Degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle
    Matsuda, H
    DISCRETE MATHEMATICS, 2004, 280 (1-3) : 241 - 250
  • [38] Matching number, Hamiltonian graphs and magnetic Laplacian matrices
    Fabila-Carrasco, John Stewart
    Lledo, Fernando
    Post, Olaf
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2022, 642 : 86 - 100
  • [39] One Sufficient Condition for Hamiltonian Graphs Involving Distances
    Kewen, Zhao
    Lin, Yue
    Zhang, Ping
    RUSSIAN MATHEMATICS, 2012, 56 (04) : 38 - 43
  • [40] One sufficient condition for Hamiltonian graphs involving distances
    Kewen Zhao
    Yue Lin
    Ping Zhang
    Russian Mathematics, 2012, 56 (4) : 38 - 43