Classification of 3-GNDB Graphs
Combinatorics
2023-12-25 v1
Abstract
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}.
Keywords
Cite
@article{arxiv.2312.14835,
title = {Classification of 3-GNDB Graphs},
author = {Amir Hosseini and Mehdi Alaeiyan and Zohreh Aliannejadi},
journal= {arXiv preprint arXiv:2312.14835},
year = {2023}
}
Comments
9pages