3 papers
math.CO2023
Generalized T-Edge Distance-Balanced Graphs
Zohreh Aliannejadi, Mehdi Alaeiyan, Alireza Gilani
A connected and nonempty graph A is defined as generalized t-edge distance-balanced, while for each edge f=α\{beta} the number of edges nearer to α than \{beta} are equal to t-time…
math.CO2023
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…
math.CO2023
2-Edge Distance-Balanced Graphs
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-…