Abstract
The product graph B * F of graphs B and F is an interesting model in the design of large reliable networks. Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width k of a graph G, k-diameter, is defined as the minimum integer d for which there exist at least k internally disjoint paths of length at most d between any two distinct vertices in G. Denote by $\cal{D}^W_c G$ the c-diameter of G and κG the connectivity of G. We prove that $\cal{D}^W_{a+b}B * F \le r_aF + \cal{D}^W_b B + 1$ for a ≤ κF and b ≤ κB. The Rabin number rcG is the minimum integer d such that there are c internally disjoint paths of length at most d from any vertex v to any set of c vertices {v1, v2,..., vc}.
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.
