Abstract
Abstract Let G = (V,E) be a graph. Then the achromatic number for the graph is the largest integer m in such a way that there is a partition of V into disjoint independent sets (V1, V2,…,Vm) satisfying the condition that for each pair of distinct sets Vi, Vj, Vi ∪ Vj is a dependent set in G. To determine the achromatic number for Butterfly and Benes networks, in this paper we have presented the approximate algorithms.
Sign-in/Register to access full text options 
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.
