Common multiples of paths and stars
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
122 | en_US |
dc.citation.spage |
115 | en_US |
dc.citation.volume |
146 | en_US |
dc.citation.woscount |
0 | en_US |
dc.contributor.author |
Chen, Zhen-Chun | en_US |
dc.contributor.author |
Shyu, Tay-Woei | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2019-09-02T07:46:20Z | |
dc.date.available |
2019-09-02T07:46:20Z | |
dc.date.issued |
2019-07-01 | en_US |
dc.description.abstract |
A graph G is a common multiple of two graphs H-1 and H-2 if G is both H-1-decomposable and H-2-decomposable. In this paper, we consider the case where H-1 is the path of length k Pk+1 and H-2 is the star with 1 edges S-1. We determine, for all positive integers k and 1, the set of integers q for which there exists a common multiple of Pk+1 and S-1 having precisely q edges. | en_US |
dc.identifier.issn |
0381-7032 | en_US |
dc.identifier.journal |
ARS COMBINATORIA | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/152715 | |
dc.identifier.wosnumber |
WOS:000478701200010 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
graph decomposition | en_US |
dc.subject |
path decomposition | en_US |
dc.subject |
star decomposition | en_US |
dc.title |
Common multiples of paths and stars | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文