World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

Connectivity and Diagnosability of Leaf-Sort Graphs

    This article is part of the issue:

    The connectivity and diagnosability of a multiprocessor system and an interconnection network are two important research topics. The system and the network have an underlying topology, which is usually presented by a graph. As a topology structure of interconnection networks, the n-dimensional leaf-sort graph CFn has many good properties. In this paper, we prove that (a) CFn is tightly 3n32 super connected for odd n and n4, and tightly 3n42 super connected for even n and n4; (b) under the PMC model and MM model, the diagnosability t(CFn)=3n32 for odd n and n4, and t(CFn)=3n42 for even n and n4.

    References

    • 1. J. A. Bondy and U. S. R. Murty, Graph Theory (Springer, New York, 2007). Google Scholar
    • 2. Anton T. Dahbura and Gerald M. Masson, An O(n2.5) fault identification algorithm for diagnosable systems, IEEE Transactions on Computers 33(6) (1984) 486–492. Crossref, ISIGoogle Scholar
    • 3. Jianxi Fan, Diagnosability of crossed cubes under the comparison diagnosis model, IEEE Transactions on Parallel and Distributed Systems 13(10) (2002) 1099–1104. Crossref, ISIGoogle Scholar
    • 4. Thomas W. Hungerford, Algebra (Springer-Verlag, New York, 1974). Google Scholar
    • 5. J. Maeng and M. Malek, A comparison connection assignment for self-diagnosis of multiprocessor systems, in Proceeding of 11th International Symposium on Fault-Tolerant Computing, 1981, pp. 173–175. Google Scholar
    • 6. F. P. Preparata, G. Metze and R. T. Chien, On the connection assignment problem of diagnosable systems, IEEE Transactions on Computers EC-16 (1967) 848–854. CrossrefGoogle Scholar
    • 7. Shiying Wang, Yanling Wang and Mujiangshan Wang, Connectivity and matching preclusion for leaf-sort graphs, Journal of Interconnection Networks 19(3) (2019) 1940007. Link, ISIGoogle Scholar
    • 8. Jun Yuan, Aixia Liu, Xue Ma, Xiuli Liu, Xiao Qin and Jifu Zhang, The g-good-neighbor conditional diagnosability of k-ary n-cubes under the PMC model and MM model, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 1165–1177. Crossref, ISIGoogle Scholar