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 use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance, bandwidth and security. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. In this paper, we give an algorithm to construct ISTs on enhanced hypercubes $Q_{n,k}$<alternatives> <inline-graphic xlink:type="simple" xlink:href="chang-ieq1-2367498.gif"/></alternatives>...
Kulasinghe and Bettayeb [Inform. Process. Lett. 53 (1995) 33-36] proved that the crossed cube CQn (a synonym called multiply twisted hypercube in that paper) fails to be vertex-transitive for n 5. In this paper, we study vertex-transitivity on folded crossed cubes FCQn and show that FCQn is vertex-transitive if and only if n ∊ {1, 2, 4}.
Zehavi and Itai (1989) proposed the following conjecture: every k-connected graph has k independent spanning trees (ISTs for short) rooted at an arbitrary node. An n-dimensional parity cube, denoted by PQn, is a variation of hyper cubes with connectivity n and has many features superior to those of hyper cubes. Recently, Wang et al. (2012) confirm the ISTs conjecture by providing an O(N log N) algorithm...
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.