View : 41 Download: 5

On the number of r-matchings in a tree

Title
On the number of r-matchings in a tree
Authors
Kang, Dong YeapKim, JaehoonKim, YounjinLaw, Hiu-Fai
Ewha Authors
김연진
Issue Date
2017
Journal Title
ELECTRONIC JOURNAL OF COMBINATORICS
ISSN
1077-8926JCR Link
Citation
vol. 24, no. 1
Keywords
matchingindependent settree
Publisher
ELECTRONIC JOURNAL OF COMBINATORICS
Indexed
SCIE; SCOPUS WOS scopus
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.
Appears in Collections:
연구기관 > 수리과학연구소 > Journal papers
Files in This Item:
On the number of r-matchings.pdf(96.96 kB)Download
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE