1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHANG, GJen_US
dc.date.accessioned2014-12-08T15:04:06Z-
dc.date.available2014-12-08T15:04:06Z-
dc.date.issued1994-02-15en_US
dc.identifier.issn0012-365Xen_US
dc.identifier.urihttp://hdl.handle.net/11536/2614-
dc.description.abstractA 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.isoen_USen_US
dc.titleTHE DOMATIC NUMBER PROBLEMen_US
dc.typeArticle; Proceedings Paperen_US
dc.identifier.journalDISCRETE MATHEMATICSen_US
dc.citation.volume125en_US
dc.citation.issue1-3en_US
dc.citation.spage115en_US
dc.citation.epage122en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:A1994NG05300015-
Appears in Collections:Conferences Paper


Files in This Item:

  1. A1994NG05300015.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...