Access the full text.
Sign up today, get DeepDyve free for 14 days.
Double commutative-step digraph generalizes the double-loop digraph. A double commutative-step digraph can be represented by an L-shaped tile, which periodically tessellates the plane. Given an initial tile L(l, h, x, y), Aguiló et al. define a discrete iteration L(p) = L(l + 2p, h + 2p, x + p, y + p), p = 0, 1, 2, …, over L-shapes (equivalently over double commutative-step digraphs), and obtain an orbit generated by L(l, h, x, y), which is said to be a procreating k-tight tile if L(p)(p = 0, 1, 2, …) are all k-tight tiles. They classify the set of L-shaped tiles by its behavior under the above-mentioned discrete dynamics and obtain some procreating tiles of double commutative-step digraphs. In this work, with an approach proposed by Li and Xu et al., we define some new discrete iteration over L-shapes and classify the set of tiles by the procreating condition. We also propose some approaches to find infinite families of realizable k-tight tiles starting from any realizable k-tight L-shaped tile L(l, h, x, y), 0 ≤ |y − x| ≤ 2k + 2. As an example, we present an infinite family of 3-tight optimal double-loop networks to illustrate our approaches.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Aug 6, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.