DSpace at EWHA: The m-step competition graph of a digraph

View : 829 Download: 0

Full metadata record

DC Field	Value	Language
dc.contributor.author	남윤순	-
dc.date.accessioned	2016-08-27T02:08:29Z	-
dc.date.available	2016-08-27T02:08:29Z	-
dc.date.issued	2000	-
dc.identifier.issn	0166-218X	-
dc.identifier.other	OAK-508	-
dc.identifier.uri	https://dspace.ewha.ac.kr/handle/2015.oak/215372	-
dc.description.abstract	The competition graph of a digraph was introduced by Cohen in 1968 associated with the study of ccosystems. Since then, the competition graph has been widely studied and many variations have been introduced. In this paper, we define and study the m-step competition graph of a digraph which is another generalization of competition graph. (C) 2000 Elsevier Science B.V. All rights reserved.	-
dc.language	English	-
dc.publisher	ELSEVIER SCIENCE BV	-
dc.subject	competition graph	-
dc.subject	competition number	-
dc.subject	m-step competition graph	-
dc.subject	m-step competition number	-
dc.title	The m-step competition graph of a digraph	-
dc.type	Article	-
dc.relation.issue	1-3	-
dc.relation.volume	105	-
dc.relation.index	SCIE	-
dc.relation.index	SCOPUS	-
dc.relation.startpage	115	-
dc.relation.lastpage	127	-
dc.relation.journaltitle	DISCRETE APPLIED MATHEMATICS	-
dc.identifier.wosid	WOS:000089203000007	-
dc.identifier.scopusid	2-s2.0-0141748828	-
dc.author.google	Cho, JJ	-
dc.author.google	Kim, SR	-
dc.author.google	Nam, Y	-
dc.date.modifydate	20180104081001	-