TOEPLITZ GRAPH DECOMPOSITION Page 1 Archive of SID www.combinatorics.ir Transactions
on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 1 No. 4 (2012), pp …

Hamiltonicity in directed Toeplitz graphs Tn〈1,2;t1,t2〉 Page 1 AUSTRALASIAN JOURNAL
OF COMBINATORICS Volume 78(3) (2020), Pages 434–449 Hamiltonicity in directed Toeplitz …

In this paper we obtain an intermediate value theorem for the decycling numbers of Toeplitz
graphs: if n ≥ 3 n≥ 3, and 0 ≤ r ≤ n-2 0≤ r≤ n-2, then there exists a Toeplitz graph of …

A directed Toeplitz graph Tn⟨ s1,..., sk; t1,..., tl⟩ with vertices 1, 2,..., n, where the edge (i, j)
occurs if and only if j− i= sp or i− j= tq for some 1≤ p≤ k and 1≤ q≤ l, is a digraph whose …

In this paper, we investigate the structure of block designs which are based on Bose's
method. We define a graph corresponding to each block design which illustrate the relation …

We present an example of an isometric subspace of a metric space that has a greater metric
dimension. We also show that the metric spaces of vector groups over the integers, defined …

A difference BIBD is a balanced incomplete block design on a group, which is constructed
by transferring a regular perfect difference system by a subgroup of its point set. There is an …