Claw-decomposition of Kneser Graphs
Publish place: Transactions on Combinatorics، Vol: 11، Issue: 1
Publish Year: 1401
نوع سند: مقاله ژورنالی
زبان: English
View: 137
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_COMB-11-1_005
تاریخ نمایه سازی: 17 آبان 1400
Abstract:
A claw is a star with three edges. The Kneser graph KG_{n,۲} is the graph whose vertices are the ۲-subsets of an n-set, in which two vertices are adjacent if and only if their intersection is empty. In this paper, we prove that KG_{n,۲} is claw-decomposable, for all n \geq ۶.
Keywords:
Authors
Sankari C
Department of Mathematics, A. V. V. M. Sri Pushpam College(Affiliated to Bharathidasan University), Poondi, Than- javur, Tamil Nadu, India
Sangeetha R
Department of Mathematics, A. V. V. M. Sri Pushpam College(Affiliated to Bharathidasan University), Poondi, Than- javur, Tamil Nadu, India
Arthi K
Department of Mathematics, A. V. V. M. Sri Pushpam College( Affiliated to Bharathidasan University), Poondi, Than- javur, Tamil Nadu, India