[PDF][PDF] Strongly edge distance-balanced graph products
STRONGLY EDGE DISTANCE-BALANCED GRAPH PRODUCTS 1 Introduction Page 1
STRONGLY EDGE DISTANCE-BALANCED GRAPH PRODUCTS Zohreh Aliannejadi1 Islamic …
STRONGLY EDGE DISTANCE-BALANCED GRAPH PRODUCTS Zohreh Aliannejadi1 Islamic …
2-Edge Distance-Balanced Graphs
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 …
introduced the number of edges of A that are closer to g than to h. We say A is a 2-edge …
Edge Quasi -distance-balanced Graphs in Metric Space
Z Aliannejadi, SS Alamoti - arXiv preprint arXiv:2406.11876, 2024 - arxiv.org
In a graph $ A $, the measure $| M_g^ A (f)|= m_g^ A (f) $ for each arbitrary edge $ f= gh $
counts the edges in $ A $ closer to $ g $ than $ h $. $ A $ is termed an edge quasi-$\lambda …
counts the edges in $ A $ closer to $ g $ than $ h $. $ A $ is termed an edge quasi-$\lambda …
Classification of 3-GNDB Graphs
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 …
edge ab,| Wab|= 3| Wba| or conversely. As well as a graph G is called generalized 3-nicely …
Generalized T-Edge Distance-Balanced Graphs
A connected and nonempty graph A is defined as generalized t-edge distance-balanced,
while for each edge f={\alpha}\{beta} the number of edges nearer to {\alpha} than\{beta} are …
while for each edge f={\alpha}\{beta} the number of edges nearer to {\alpha} than\{beta} are …