Neighborhood Balanced Colorings of Graphs
Bryan Freyberg, Alison M. Marr · Graphs and Combinatorics · 2024
Abstract Given a simple graph G, we ask when V(G) may be partitioned into two sets such that every vertex has an equal number of neighbors from each set. We establish a number of results for common families of graphs and completely classify 4-regular circulants which posses this property.