1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Debajyoti Mondal, N. Parthiban, Indra Rajasingh
The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given an undirected graph G, we exa…