Localizing combinatorial properties for partitions on block graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
441 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
429 | en_US |
dc.citation.volume |
2 | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Chang, GJ | en_US |
dc.contributor.author |
Hwang, FK | en_US |
dc.contributor.author |
Yao, YC | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:47:07Z | |
dc.date.available |
2014-12-08T15:47:07Z | |
dc.date.issued |
1999 | en_US |
dc.description.abstract |
We extend the study on partition properties from the set partition to the graph partition, especially for the class of connected block graphs which includes trees. We introduce seventeen partition properties and determine their inter-relations. The notions of k-consistency and k-sortability were studied in the set partition to localize the properties, i.e., a global property can be verified through checking local conditions. We carry on these studies for partitions on connected block graphs. In particular, we completely determine the consistency for an the seventeen properties. | en_US |
dc.identifier.issn |
1382-6905 | en_US |
dc.identifier.journal |
JOURNAL OF COMBINATORIAL OPTIMIZATION | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/31623 | |
dc.identifier.wosnumber |
WOS:000079289400010 | |
dc.language.iso |
en_US | en_US |
dc.subject |
partition | en_US |
dc.subject |
block graph | en_US |
dc.subject |
tree | en_US |
dc.subject |
penetration | en_US |
dc.subject |
nested partition | en_US |
dc.subject |
consecutive partition | en_US |
dc.subject |
order consecutive partition | en_US |
dc.title |
Localizing combinatorial properties for partitions on block graphs | en_US |
dc.type |
Article | en_US |
檔案
- 000079289400010.pdf (80.1 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Chang, G., Hwang, F., & Yao, Y. (1999). Localizing combinatorial properties for partitions on block graphs. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2(4), 429–441. https://ir.lib.nycu.edu.tw/handle/11536/31623
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31623