1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorJou, MJen_US
dc.contributor.authorChang, GJen_US
dc.date.accessioned2014-12-08T15:44:36Z-
dc.date.available2014-12-08T15:44:36Z-
dc.date.issued2000-12-01en_US
dc.identifier.issn1027-5487en_US
dc.identifier.urihttp://hdl.handle.net/11536/30111-
dc.description.abstractIn 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.language.isoen_USen_US
dc.subjectindependent seten_US
dc.subjecttreeen_US
dc.subjectforesten_US
dc.subjectconnected graphen_US
dc.subjectcycleen_US
dc.subjecttriangleen_US
dc.subjectleafen_US
dc.subjectdistanceen_US
dc.titleThe number of maximum independent sets in graphsen_US
dc.typeArticleen_US
dc.identifier.journalTAIWANESE JOURNAL OF MATHEMATICSen_US
dc.citation.volume4en_US
dc.citation.issue4en_US
dc.citation.spage685en_US
dc.citation.epage695en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000165960200012-
dc.citation.woscount14-
Appears in Collections:Articles


Related Contents
Loading...