EDGE DOMATIC NUMBERS OF COMPLETE N-PARTITE GRAPHS
| dc.citation.epage | 248 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 241 | en_US |
| dc.citation.volume | 10 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | HWANG, SF | en_US |
| dc.contributor.author | CHANG, GJ | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:04:14Z | |
| dc.date.available | 2014-12-08T15:04:14Z | |
| dc.date.issued | 1994 | en_US |
| dc.description.abstract | An edge dominating set of a graph is a set of edges D such that every edge not in D is adjacent to an edge in 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 of G. In this paper we study the edge domatic numbers of complete n-partite graphs. In particular, we give exact values for the edge domatic numbers of complete 3-partite graphs and balanced complete n-partite graphs with odd n. | en_US |
| dc.identifier.doi | 10.1007/BF02986672 | en_US |
| dc.identifier.issn | 0911-0119 | en_US |
| dc.identifier.journal | GRAPHS AND COMBINATORICS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1007/BF02986672 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/2737 | |
| dc.identifier.wosnumber | WOS:A1994PT00300006 | |
| dc.language.iso | en_US | en_US |
| dc.title | EDGE DOMATIC NUMBERS OF COMPLETE N-PARTITE GRAPHS | en_US |
| dc.type | Article | en_US |