Maximal independent sets in graphs with at most one cycle

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Jou, MJ	en_US
dc.contributor.author	Chang, GJ	en_US
dc.date.accessioned	2014-12-08T15:01:18Z	-
dc.date.available	2014-12-08T15:01:18Z	-
dc.date.issued	1997-11-27	en_US
dc.identifier.issn	0166-218X	en_US
dc.identifier.uri	http://hdl.handle.net/11536/185	-
dc.description.abstract	In this paper, we determine the largest number of maximal independent sets among all connected graphs of order n, which contain at most one cycle. We also characterize those extremal graphs achieving this maximum value. As a consequence, the corresponding results for graphs with at most one cycle but not necessarily connected are also given.	en_US
dc.language.iso	en_US	en_US
dc.subject	(maximal) independent set	en_US
dc.subject	cycle	en_US
dc.subject	connected graph	en_US
dc.subject	isolated vertex	en_US
dc.subject	leaf	en_US
dc.subject	baton	en_US
dc.title	Maximal independent sets in graphs with at most one cycle	en_US
dc.type	Article; Proceedings Paper	en_US
dc.identifier.journal	DISCRETE APPLIED MATHEMATICS	en_US
dc.citation.volume	79	en_US
dc.citation.issue	1-3	en_US
dc.citation.spage	67	en_US
dc.citation.epage	73	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:A1997YE03100006	-
顯示於類別：	會議論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。