Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1710602 | Applied Mathematics Letters | 2006 | 4 Pages |
Abstract
Let RR be the set of real numbers and DD be a subset of the positive real numbers. The distance graph G(R,D)G(R,D) is a graph with the vertex set RR and two vertices xx and yy are adjacent if and only if |x−y|∈D|x−y|∈D. In this work, the vertex arboricity (i.e., the minimum number of subsets into which the vertex set V(G)V(G) can be partitioned so that each subset induces an acyclic subgraph) of G(R,D)G(R,D) is determined for DD being an interval between 1 and δδ.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Liancui Zuo, Qinglin Yu, Jianliang Wu,