Abstract
A multiprocessor system and interconnection network have a underlying topology, which is usually presented by a graph, where nodes represent processors and links represent communication links between processors. The (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves the resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matchings. In this paper, we prove that (1) the connectivity (edge connectivity) of the leaf-sort graph CFn is [Formula: see text] for odd n and [Formula: see text] for even n; (2) CFn is super edge-connected; (3) the matching preclusion number of CFn is [Formula: see text] for odd n and [Formula: see text] for even n; (4) the conditional matching preclusion number of CFn is 3n – 5 for odd n and n ≥ 3, and 3n – 6 for even n and n ≥ 4.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
