This research identifies properties and classifications of cubic 3-balanced graphs, indicating their structural balancing.
A graph is said to be neighborhood 3-balanced if there exists a vertex labeling with three colors so that each vertex has an equal number of neighbors of each color. We give order constraints on 3-balanced graphs, determine which generalized Petersen and Pappus graphs are 3-balanced, discuss when being 3-balanced is preserved under various graph constructions, give two general characterizations of cubic 3-balanced graphs, and classify cubic 3-balanced graphs of small order.
No takes yet. Share an insight, caveat, or question.
Minyard et al. (2026) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: