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 条

[41] A novel scheme of k-step iterations in digital metric spaces
Botmart, Thongchai
Shaheen, Aasma
Batool, Afshan
Etemad, Sina
Rezapour, Shahram
AIMS MATHEMATICS, 2023, 8 (01): : 873 - 886
[42] Fusion Kalman filtration with k-step delay sharing pattern
Duda, Zdzislaw
ARCHIVES OF CONTROL SCIENCES, 2015, 25 (03): : 307 - 318
[43] MODELING ERRORS IN TIME-SERIES AND K-STEP PREDICTIONS
DELPINO, GE
MARSHALL, P
LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1986, 87 : 88 - 98
[44] Advanced K-step forward prediction algorithm in wireless channel
Yu, GW
Wang, HY
Sheng, DH
2004 INTERNATIONAL CONFERENCE ON COMMUNICATION, CIRCUITS, AND SYSTEMS, VOLS 1 AND 2: VOL 1: COMMUNICATION THEORY AND SYSTEMS - VOL 2: SIGNAL PROCESSING, CIRCUITS AND SYSTEMS, 2004, : 277 - 281
[45] IMPLICIT APPLICATION OF POLYNOMIAL FILTERS IN A K-STEP ARNOLDI METHOD
SORENSEN, DC
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1992, 13 (01) : 357 - 385
[46] BiRch: A bidirectional search algorithm for k-step reachability queries
School of Information Science and Engineering, Yanshan University, Qinhuangdao
066004, China
不详
066004, China
Tongxin Xuebao, 8
[47] Efficient k-step Weighted Reachability Queries Processing Algorithms
Mei, Congquan
Zhou, Junfeng
Du, Ming
Chen, Lian
Yu, Sheng
Tang, Xian
Chen, Ziyang
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2025,
[48] A NOTE ON HAMILTONIAN DECOMPOSITIONS OF CAYLEY-GRAPHS
BAUMANN, U
LESCH, M
SCHMEICHEL, I
ABHANDLUNGEN AUS DEM MATHEMATISCHEN SEMINAR DER UNIVERSITAT HAMBURG, 1995, 65 : 105 - 111
[49] A Note on Hamiltonian-intersecting families of graphs
Leader, Imre
Randelovic, Zarko
Tan, Ta Sheng
DISCRETE MATHEMATICS, 2024, 347 (11)
[50] Hint-K: An Efficient Multilevel Cache Using K-Step Hints
Wu, Chentao
He, Xubin
Cao, Qiang
Xie, Changsheng
Wan, Shenggang
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (03) : 653 - 662

← 1 2 3 4 5 →