Abstract
The effectiveness and dependability of a network can be examined using graph theory techniques, and the dependability of the network can be evaluated using its connection. Removing some vertices or edges can enhance a network\\'s diameter, which is a measure of its efficiency. In this paper, we calculate the maximum diameter ????????(????????) of the modified graph ???? with ???? (????≥????) vertices, which resulted from removing t edges from the complete graph ????????,(????≥????) was determined using the adjacency matrix ????????????(????????).
Keywords
Edges deletion problem; Maximum diameter; Complete graph; Adjacency matrix