Some results on ascending subgraph decomposition

CSpace

	Some results on ascending subgraph decomposition
	Zhuo, XJ ; Su, YM
	1999-05-01
发表期刊	UTILITAS MATHEMATICA
ISSN	0315-3681
卷号	55 页码:153-160
摘要	Let G be a graph of positive size q, and let n be that positive integer for which ((n+1)(2)) less than or equal to q < ((n+2)(2)). Then G is said to have an ascending subgraph decomposition if G can be decomposed into n subgraphs G(1),G(2), ..., G(n) without isolated vertices such that G(i) is isomorphic to a proper subgraph of G(i+1), for i = 1, 2, ..., n - 1. The graph G is shown to have an ascending subgraph decomposition when either G = K-n - Hn+[(n-1)/2] (where Hn+[(n-1)/2] is a subgraph of K-n with at most n + [(n - 1)/2] edges) or G is any complete bipartite graph.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied ; Statistics & Probability
WOS记录号	WOS:000080420500013
出版者	UTIL MATH PUBL INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14526
专题	中国科学院数学与系统科学研究院
作者单位	1.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China 2.Shandong Univ Technol, Dept Math & Phys, Jinan 250061, Peoples R China
推荐引用方式 GB/T 7714	Zhuo, XJ,Su, YM. Some results on ascending subgraph decomposition[J]. UTILITAS MATHEMATICA,1999,55:153-160.
APA	Zhuo, XJ,&Su, YM.(1999).Some results on ascending subgraph decomposition.UTILITAS MATHEMATICA,55,153-160.
MLA	Zhuo, XJ,et al."Some results on ascending subgraph decomposition".UTILITAS MATHEMATICA 55(1999):153-160.