Abstract
It is well known that maximum connectivity graphs play an important role in the design of reliable networks. The class of symmetric graphs called circulants is known to contain such maximum connectivity graphs. Although not all circulants have this maximum connectivity property, those that do have a great variation in their diameters. Since diameter is a measure of transmission delay, the minimum diameter, maximum connectivity circulant problem is considered here. Several results are given for the general case and a simple solution is derived for the connectivity four case.
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.
