Graphs with small balanced decomposition numbers

淡江大學機構典藏 > 理學院 > 應用數學與數據科學學系 > 期刊論文 > Item 987654321/115405

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/115405

题名:	Graphs with small balanced decomposition numbers
作者:	Hsiang-Chun Hsu;Gerard Jennhwa Chang
关键词:	Balanced coloring;Balanced decomposition;Balanced decomposition number;Connectivity
日期:	2014-08-31
上传时间:	2018-10-25 12:10:56 (UTC+8)
出版者:	Springer US
摘要:	A balanced coloring of a graph G is an ordered pair (R,B) of disjoint subsets R,B⊆V(G) with \|R\|=\|B\| . The balanced decomposition number f(G) of a connected graph G is the minimum integer f such that for any balanced coloring (R,B) of G there is a partition P of V(G) such that S induces a connected subgraph with \|S\|≤f and \|S∩R\|=\|S∩B\| for S∈P . This paper gives a short proof for the result by Fujita and Liu (2010) that a graph G of n vertices has f(G)=3 if and only if G is ⌊n2⌋ -connected but is not a complete graph.
關聯:	Journal of Combinatorial Optimization 28(2), p.505-510
DOI:	10.1007/s10878-012-9576-6
显示于类别:	[應用數學與數據科學學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	141	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章