Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Neighborhood 3-Balanced Graphs

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月5日

查看全文
  • Mitchell Minyard,
  • Mark R. Sepanski

摘要

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.