Classification of 3-GNDB Graphs

Amir Hosseini, Mehdi Alaeiyan, Zohreh Aliannejadi

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 di…