EDGE DOMINATION IN COMPLETE PARTITE GRAPHS

Full metadata record

DC Field	Value	Language
dc.contributor.author	CHEN, BL	en_US
dc.contributor.author	FU, HL	en_US
dc.date.accessioned	2014-12-08T15:03:46Z	-
dc.date.available	2014-12-08T15:03:46Z	-
dc.date.issued	1994-09-15	en_US
dc.identifier.issn	0012-365X	en_US
dc.identifier.uri	http://hdl.handle.net/11536/2323	-
dc.description.abstract	An 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.iso	en_US	en_US
dc.title	EDGE DOMINATION IN COMPLETE PARTITE GRAPHS	en_US
dc.type	Article	en_US
dc.identifier.journal	DISCRETE MATHEMATICS	en_US
dc.citation.volume	132	en_US
dc.citation.issue	1-3	en_US
dc.citation.spage	29	en_US
dc.citation.epage	35	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:A1994PJ10800004	-
dc.citation.woscount	0	-
Appears in Collections:	Articles

Files in This Item:

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.