1 paper
Zohreh Aliannejadi, Mehdi alaeiyan, Alireza Gilani +1
In a graph A, for each two arbitrary vertices g, h with d(g,h)=2,|MAg2h|=mAg2h is introduced the number of edges of A that are closer to g than to h. We say A is a 2-edge distance-…