Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHEN, BLen_US
dc.contributor.authorFU, HLen_US
dc.date.accessioned2014-12-08T15:03:46Z-
dc.date.available2014-12-08T15:03:46Z-
dc.date.issued1994-09-15en_US
dc.identifier.issn0012-365Xen_US
dc.identifier.urihttp://hdl.handle.net/11536/2323-
dc.description.abstractAn edge dominating set in a graph G is a set of edges D such that every edge not in D is adjacent to an edge of D. An edge domatic partition of a graph G = (V, E) is a collection of pairwise-disjoint edge dominating sets of G whose union is E. The maximum size of an edge domatic partition of G is called the edge domatic number. In this paper, we study the edge domatic number of the complete partite graphs and give the answers for balanced complete partite graphs and complete split graphs.en_US
dc.language.isoen_USen_US
dc.titleEDGE DOMINATION IN COMPLETE PARTITE GRAPHSen_US
dc.typeArticleen_US
dc.identifier.journalDISCRETE MATHEMATICSen_US
dc.citation.volume132en_US
dc.citation.issue1-3en_US
dc.citation.spage29en_US
dc.citation.epage35en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:A1994PJ10800004-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. A1994PJ10800004.pdf