2000 character limit reached
Classification of 3-GNDB Graphs
Published 22 Dec 2023 in math.CO | (2312.14835v1)
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}.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
