  A nonempty graph G is called generalized 3-distance-balanced, (3-GDB)
whenever for every edge ab, |Wab|=3|Wba| or conversely. As well as a graph G is
called generalized 3-nicely distance-balanced (3-GNDB) whenever for every edge
ab of G, there exists a positive integer g, such that: |Wba|=gG. In this paper,
we classify 3-GNDB graphs with, gG \in{1,2}.
