Dependent and Independent Sets 线性相关与线性无关集
Explicit recurrences are derived for their matching and independence polynomials and the number of defect-d matchings for some values of d. We also determine the extremal chain polygonal cacti with respect to the number of matchings and of independent sets.
另外,我们确定了关于k-匹配和k-独立集的多边形Cacti链的极值链。
参考来源 - 图中的若干极值问题·2,447,543篇论文数据,部分数据来源于NoteExpress
应用推荐