The number of maximum independent sets in graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
695 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
685 | en_US |
dc.citation.volume |
4 | en_US |
dc.citation.woscount |
14 | |
dc.contributor.author |
Jou, MJ | en_US |
dc.contributor.author |
Chang, GJ | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:44:36Z | |
dc.date.available |
2014-12-08T15:44:36Z | |
dc.date.issued |
2000-12-01 | en_US |
dc.description.abstract |
In this paper, we study the problem of determining the largest number of maximum independent sets of a graph of order n. Solutions to this problem are given for various classes of graphs, including general graphs, trees, forests, (connected) graphs with at most one cycle, connected graphs and triangle-free graphs. Extremal graphs achieving the maximum values are also given. | en_US |
dc.identifier.issn |
1027-5487 | en_US |
dc.identifier.journal |
TAIWANESE JOURNAL OF MATHEMATICS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/30111 | |
dc.identifier.wosnumber |
WOS:000165960200012 | |
dc.language.iso |
en_US | en_US |
dc.subject |
independent set | en_US |
dc.subject |
tree | en_US |
dc.subject |
forest | en_US |
dc.subject |
connected graph | en_US |
dc.subject |
cycle | en_US |
dc.subject |
triangle | en_US |
dc.subject |
leaf | en_US |
dc.subject |
distance | en_US |
dc.title |
The number of maximum independent sets in graphs | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文