Abstract
The dependability and effectiveness of a network can be investigated using a variety of graph-theoretic techniques, and the network's connectivity determines how reliable it is. Diameter in a network is often used to measure the efficiency of a network in the event that a network experiences issues such as a decline in the communication signal or a breakdown in the communication between its components. This paper examines the increase in diameter of the generalized Petersen graph after removing a certain number of edges. Finding the exact values of f(n,t) that represent the maximum diameter of an altered generalized Petersen graph GP(n,k,t) obtained after removing edges from for k=1 and t≥2.
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.
