DSpace at EWHA: On the number of r-matchings in a tree

View : 981 Download: 355

Full metadata record

DC Field	Value	Language
dc.contributor.author	김연진	-
dc.date.accessioned	2017-10-27T11:18:32Z	-
dc.date.available	2017-10-27T11:18:32Z	-
dc.date.issued	2017	-
dc.identifier.issn	1077-8926	-
dc.identifier.other	OAK-20177	-
dc.identifier.uri	https://dspace.ewha.ac.kr/handle/2015.oak/237002	-
dc.description.abstract	An r-matching in a graph G is a collection of edges in G such that the distance between any two edges is at least r. This generalizes both matchings and induced matchings as matchings are 1-matchings and induced matchings are 2-matchings. In this paper, we estimate the minimum and maximum number of r-matchings in a tree with fixed order.	-
dc.language	English	-
dc.publisher	ELECTRONIC JOURNAL OF COMBINATORICS	-
dc.subject	matching	-
dc.subject	independent set	-
dc.subject	tree	-
dc.title	On the number of r-matchings in a tree	-
dc.type	Article	-
dc.relation.issue	1	-
dc.relation.volume	24	-
dc.relation.index	SCIE	-
dc.relation.index	SCOPUS	-
dc.relation.journaltitle	ELECTRONIC JOURNAL OF COMBINATORICS	-
dc.identifier.wosid	WOS:000408643100011	-
dc.identifier.scopusid	2-s2.0-85011585885	-
dc.author.google	Kang, Dong Yeap	-
dc.author.google	Kim, Jaehoon	-
dc.author.google	Kim, Younjin	-
dc.author.google	Law, Hiu-Fai	-
dc.contributor.scopusid	김연진(55574123179)	-
dc.date.modifydate	20210614145854	-