Hamiltonicity in Directed Toeplitz Graphs with s1 = 1 and s3 = 4
S Malik - Computational and Mathematical Methods, 2023 - Wiley Online Library
Computational and Mathematical Methods, 2023•Wiley Online Library
… Then, we investigate the Hamiltonicity of the directed Toeplitz graphs with s 3 = 4, s 2 = 3,
s 1 = 1, and l = 2. We also investigate the Hamiltonicity of the directed Toeplitz graphs with s
3 = 4, s 2 = 2, and l = 2, ie, T n <1, 2, 4; t 1 , t 2 >. Thus, in this paper, we complete the
Hamiltonicity investigation of the directed Toeplitz graphs with s 3 = 4 and s 1 = 1. …
s 1 = 1, and l = 2. We also investigate the Hamiltonicity of the directed Toeplitz graphs with s
3 = 4, s 2 = 2, and l = 2, ie, T n <1, 2, 4; t 1 , t 2 >. Thus, in this paper, we complete the
Hamiltonicity investigation of the directed Toeplitz graphs with s 3 = 4 and s 1 = 1. …
A directed Toeplitz graph Tn〈s1, ⋯, sk; t1, ⋯, tl〉 with vertices 1, 2, ⋯, n is a directed graph whose adjacency matrix is a Toeplitz matrix. In this paper, we investigate the Hamiltonicity in directed Toeplitz graphs Tn〈s1, ⋯, sk; t1, ⋯, tl〉 with s1 = 1 and s3 = 4.
Wiley Online Library以上显示的是最相近的搜索结果。 查看全部搜索结果