A Proposed Method by Using the Adjacency Matrix to Solve the Edges Deletion Problem of Complete Graphs
Abstract
Graph theory approaches can be used to investigate a network’s dependability and effectiveness, and the network’s connectivity can be used to assess its dependability. The efficiency of a network is measured by its diameter, which can be somewhat increased by removing some vertices or edges. In this work, the maximum diameter fn(tt) of the modified graph G with n (n≥4) vertices, which resulted from removing t edges from the complete graph Kn ,(n≥4) was determined using the adjacency matrix adj(Kn).
Fields of Study & Subjects
Interconnection Networks and Systems
Graph theory and applications
Advanced Optical Network Technologies
Publication details
- Journal / source
- Journal of Kufa for Mathematics and Computer
- Volume
- 12
- Issue
- 1
- Pages
- 1–5
- Publication date
- 5 January 2026