完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Hsu, LH | en_US |
dc.date.accessioned | 2014-12-08T15:41:56Z | - |
dc.date.available | 2014-12-08T15:41:56Z | - |
dc.date.issued | 2002-09-28 | en_US |
dc.identifier.issn | 0012-365X | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/28516 | - |
dc.description.abstract | Let m(G) denote the number of vertices covered by a maximum matching in a graph G. The ultimate categorical matching m*(G) is defined as m*(G) = lim(n-->infinity)m(G(n))(1/n) where the categorical graph product is used. In (Discrete Math. 232 (2001) 1), Albert et al. ask that "Is there a graph G, with at least one edge, such that for all graphs H, m* (G x H) = m * (G)m * (H)?". Actually, m*(G x H) = m*(G)m*(H) holds for any graphs G and H with the previous result of Hsu et al. (Discrete Math. 65 (1987) 53). (C) 2002 Elsevier Science B.V. All rights reserved. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | categorical product | en_US |
dc.subject | matching | en_US |
dc.subject | graph capacity functions | en_US |
dc.title | A note on the ultimate categorical matching in a graph | en_US |
dc.type | Article | en_US |
dc.identifier.journal | DISCRETE MATHEMATICS | en_US |
dc.citation.volume | 256 | en_US |
dc.citation.issue | 1-2 | en_US |
dc.citation.spage | 487 | en_US |
dc.citation.epage | 488 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000179151400039 | - |
dc.citation.woscount | 1 | - |
顯示於類別: | 期刊論文 |