Neighborhood Balanced Colorings of Graphs

IF 0.6 4区数学 Q3 MATHEMATICS

Graphs and Combinatorics Pub Date : 2024-03-26 DOI:10.1007/s00373-024-02766-9

Bryan Freyberg, Alison Marr

引用次数: 0

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.

Abstract Image

查看原文本刊更多论文

图形的邻里平衡着色

给定一个简单图 G，我们会问什么时候 V(G) 可以划分为两个集合，使得每个顶点在每个集合中都有数量相等的邻居。我们为常见的图族建立了一系列结果，并完整地分类了具有这一性质的 4 不规则环形图。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Graphs and Combinatorics 数学-数学

CiteScore

1.00

自引率

14.30%

发文量

160

审稿时长

6 months

期刊介绍： Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.