Read More
Date: 23-4-2022
1433
Date: 26-3-2022
1295
Date: 2-8-2016
1643
|
The graph diameter of a graph is the length of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices , where is a graph distance. In other words, a graph's diameter is the largest number of vertices which must be traversed in order to travel from one vertex to another when paths which backtrack, detour, or loop are excluded from consideration. It is therefore equal to the maximum of all values in the graph distance matrix. The above random graphs on 10 vertices have diameters 3, 4, 5, and 7, respectively.
A disconnected graph has infinite diameter (West 2000, p. 71).
The diameter of a graph may be computed in the Wolfram Language using GraphDiameter[g], and a fast approximation to the diameter by GraphDiameter[g, Method -> "PseudoDiameter"]. Precomputed diameters for many named graphs can be obtained using GraphData[graph, "Diameter"].
Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 14, 1994.
Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, p. 107, 1990.
West, D. B. Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 2000.
|
|
دور النظارات المطلية في حماية العين
|
|
|
|
|
العلماء يفسرون أخيرا السبب وراء ارتفاع جبل إيفرست القياسي
|
|
|
|
|
اختتام المراسم التأبينية التي أهدي ثوابها إلى أرواح شهداء المق*ا*و*مة
|
|
|