The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The star graph has been an attractive interconnection network, and possesses many nice properties. In this paper, we consider the cycle embedding problem in star graphs with conditional edge faults. We show that there exist cycles of all even lengths from 6 to n! in an n-dimensional star graph with ?? 2n - 7 edge faults in which each vertex is incident with at least two healthy edges for n ?? 4.
Many research on the WK-recursive network has been published during the past several years due to its favorite properties. In this paper, we consider the fault-tolerant hamiltonian connectivity of the WK-recursive network. We use K(d, t) to denote the WK-recursive network of level t, each of which basic modules is a d-vertex complete graph. The fault-tolerant hamiltonian connectivity is defined to...
Recursive Dual-Net (RDN) was proposed recently as an effective, high-performance interconnection network for supercomputers with millions of nodes. A Recursive Dual-Net RDN (B) is recursively constructed on a base symmetric network B. At each iteration, the network is extended through dual-construction. The dual-construction extends a symmetric graph G into a symmetric graph G' with size 2n2 and node-degree...
The Cartesian product of two graphs can combine the two topologies; this method can inherit the properties from the both topologies. Cayley digraph is an excellent model for interconnection networks, it has good properties such as vertex transitive, symmetry, low degree and diameter. In this paper, we discuss some properties in Cartesian product of Cayley graphs including Hamiltonian circle, large...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.