Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cheng, Eddie | en_US |
dc.contributor.author | Liptak, Laszlo | en_US |
dc.contributor.author | Hsu, Lih-Hsing | en_US |
dc.contributor.author | Tan, Jimmy J. M. | en_US |
dc.contributor.author | Lin, Cheng-Kuan | en_US |
dc.date.accessioned | 2015-07-21T08:29:10Z | - |
dc.date.available | 2015-07-21T08:29:10Z | - |
dc.date.issued | 2015-04-01 | en_US |
dc.identifier.issn | 0381-7032 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/124685 | - |
dc.description.abstract | The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those incident to a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those incident to a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In this paper, we find this number and classify all optimal sets for the star graphs, one of the most popular interconnection networks. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Interconnection networks | en_US |
dc.subject | perfect matching | en_US |
dc.subject | star graphs | en_US |
dc.title | CONDITIONAL MATCHING PRECLUSION FOR THE STAR GRAPHS | en_US |
dc.type | Article | en_US |
dc.identifier.journal | ARS COMBINATORIA | en_US |
dc.citation.volume | 120 | en_US |
dc.citation.spage | 369 | en_US |
dc.citation.epage | 382 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000354006100033 | en_US |
dc.citation.woscount | 0 | en_US |
Appears in Collections: | Articles |