Balanced graph partitions

被引：0

作者：

Protasova, KD

机构：

来源：

MATHEMATICAL NOTES | 2006年 / 79卷 / 1-2期

关键词：

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

D O I：

10.1007/s11006-006-0011-0

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that the set of vertices V, vertical bar V vertical bar = 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.

引用

页码：116 / 121

页数：6

共 50 条

[1] Balanced Graph Partitions
K. D. Protasova
[J]. Mathematical Notes, 2006, 79 : 116 - 121
[2] Balanced partitions
Sam Vandervelde
[J]. The Ramanujan Journal, 2010, 23 : 297 - 306
[3] Balanced partitions
Vandervelde, Sam
[J]. RAMANUJAN JOURNAL, 2010, 23 (1-3): : 297 - 306
[4] Finding balanced graph bi-partitions using a hybrid genetic algorithm
Steenbeck, AG
Marchiori, E
Eiben, AE
[J]. 1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, : 90 - 95
[5] Balanced Partitions of Trees and Applications
Feldmann, Andreas Emil
Foschini, Luca
[J]. 29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012), 2012, 14 : 100 - 111
[6] Balanced partitions for Markov chains
Teresa Gallegos M.
Ritter G.
[J]. Results in Mathematics, 2000, 37 (3-4) : 246 - 273
[7] Balanced partitions of vector sequences
Bárány, I
Doerr, B
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 414 (2-3) : 464 - 469
[8] Balanced Partitions of Trees and Applications
Andreas Emil Feldmann
Luca Foschini
[J]. Algorithmica, 2015, 71 : 354 - 376
[9] Balanced Partitions of Trees and Applications
Feldmann, Andreas Emil
Foschini, Luca
[J]. ALGORITHMICA, 2015, 71 (02) : 354 - 376
[10] CHROMATIC PARTITIONS OF A GRAPH
SAMPATHKUMAR, E
VENKATACHALAM, CV
[J]. DISCRETE MATHEMATICS, 1989, 74 (1-2) : 227 - 239

← 1 2 3 4 5 →