一类整数距离图的点荫度

Vertex arboricity of a class of integer distance graphs

整数距离图以全体整数作为顶点集,顶点u、v相邻当且仅当|u-v|∈D,其中D是一个正整数集.对于m>3,令Dm=[1,m]\[1,3].本研究得到了G(Dm)的点荫度.

An integer distance graph is a graph with all integers as vertex set, and two vertices u,υ Z are adjacent if and only if ｜u-υ｜∈D where the distance set Dis a subset of the positive integer set. Let Dm=Dm=[1,m]／[1,3] for m〉3, the vertex arboricity of the integer distance graph G（Dm） is obtained.