Abstract
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V(G) can be partitioned so that each subset induces an acyclic subgraph. The fractional version of vertex arboricity is introduced in this paper. We determine fractional vertex arboricity for several classes of graphs, e.g., complete multipartite graphs, cycles, integer distance graphs, prisms and Peterson graph. © 2007 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Yu, Q., & Zuo, L. (2007). Fractional Vertex Arboricity of Graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4381 LNCS, pp. 245–252). https://doi.org/10.1007/978-3-540-70666-3_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
