Advertisement

Mathematical Notes

, Volume 79, Issue 1–2, pp 116–121 | Cite as

Balanced Graph Partitions

  • K. D. Protasova
Article

Abstract

We prove that the set of vertices V, |V| = rk, of a connected graph G can be split into r subsets of the same cardinality in such a way that the distance between any vertex of G and any subset of the partition is at most r.

Key words

balanced graph coloring diameter of a graph star graph balanced partition spanning tree r-critical tree Cayley graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Karaganis, “On the cube of graphs,” Canad. Math. Bull., 11 (1969), 295–296.MathSciNetGoogle Scholar
  2. 2.
    K. D. Protasova, “Kaleidoscopic graphs,” Math. Stud., 18 (2002), 3–9.MATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  • K. D. Protasova
    • 1
  1. 1.KievUkraine

Personalised recommendations