Department of Mathematics, Faculty of Computer Science and Mathematics, University of Kufa, Kufa 54003, Iraq.
10.24271/psr.2025.499398.1897
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. In this work, we studied the concept of maximum diameter for a few graph kinds (complete graph, hypercube graph, and generalized Petersen graph). We calculate the maximum diameter values denoted by f(tt,D) of an altered graph G with n (n≥4) vertices, which is obtained by eliminating tt edges from a complete graph Kn that has n vertices and contains the greatest quantity of edges in all simple graphs.
Jasim,A Nasif. (2025). On the Maximum Diameter of Graphs. Passer Journal of Basic and Applied Sciences, 7(2), 729-732. doi: 10.24271/psr.2025.499398.1897
MLA
Jasim,A Nasif. "On the Maximum Diameter of Graphs", Passer Journal of Basic and Applied Sciences, 7, 2, 2025, 729-732. doi: 10.24271/psr.2025.499398.1897
HARVARD
Jasim A Nasif. (2025). 'On the Maximum Diameter of Graphs', Passer Journal of Basic and Applied Sciences, 7(2), pp. 729-732. doi: 10.24271/psr.2025.499398.1897
CHICAGO
A Nasif Jasim, "On the Maximum Diameter of Graphs," Passer Journal of Basic and Applied Sciences, 7 2 (2025): 729-732, doi: 10.24271/psr.2025.499398.1897
VANCOUVER
Jasim A Nasif. On the Maximum Diameter of Graphs. PJBAS. 2025;7(2):729-732. doi: 10.24271/psr.2025.499398.1897
Passer Journal of Basic and Applied Sciences
