THE DOMATIC NUMBER PROBLEM

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	CHANG, GJ	en_US
dc.date.accessioned	2014-12-08T15:04:06Z	-
dc.date.available	2014-12-08T15:04:06Z	-
dc.date.issued	1994-02-15	en_US
dc.identifier.issn	0012-365X	en_US
dc.identifier.uri	http://hdl.handle.net/11536/2614	-
dc.description.abstract	A dominating set of a graph G=(V,E) is a subset D of V such that every vertex not in D is adjacent to some vertex in D. The domatic number d(G) of G is the maximum positive integer k such that V can be partitioned into k pairwise disjoint dominating sets. The purpose of this paper is to study the domatic numbers of graphs that are obtained from small graphs by performing graph operations, such as union, join and Cartesian product.	en_US
dc.language.iso	en_US	en_US
dc.title	THE DOMATIC NUMBER PROBLEM	en_US
dc.type	Article; Proceedings Paper	en_US
dc.identifier.journal	DISCRETE MATHEMATICS	en_US
dc.citation.volume	125	en_US
dc.citation.issue	1-3	en_US
dc.citation.spage	115	en_US
dc.citation.epage	122	en_US
dc.contributor.department	交大名義發表	zh_TW
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	National Chiao Tung University	en_US
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:A1994NG05300015	-
顯示於類別：	會議論文

文件中的檔案：

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