Zobrazeno 1 - 2
of 2
pro vyhledávání: '"S. M. Citra"'
Publikováno v:
Advances in Mathematics: Scientific Journal. 9:8941-8946
Publikováno v:
Journal of Physics: Conference Series. 1836:012025
All graph in this paper is simple graph. Let G = (V, E) where V is nonempty of vertex set of G and E is possibly empty set of unordered pairs of elements of V. The distance from u to v in G is the lenght of a shortest path joining them, denoted by d(