Abstract
Abstract : A (d,c,v)-graph is a c-connected graph of diameter d in which each node is of valence v. A minimum (d,c,v)-graph is one with the minimum number of nodes. Each minimum (d,c,v)-graph corresponds to an efficient way of arranging the stations of a communication network so that if any c-1 stations are incapacitated, the rest of the network is still connected, and so that in case of breakdown or other difficulty each station can rely for assistance on precisely v others. Here the minimum (d,3,3)-graphs are classified and counted for odd d. (Author)
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.
