Cubic graphs with equal independence number and matching number

被引：3

作者：

Mohr, Elena ^{[1
]}

Rautenbach, Dieter ^{[1
]}

机构：

[1] Ulm Univ, Inst Optimizat & Operat Res, Ulm, Germany

来源：

DISCRETE MATHEMATICS | 2021年 / 344卷 / 01期

关键词：

Independence number; Matching number;

D O I：

10.1016/j.disc.2020.112178

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Caro, Davila, and Pepper recently proved delta(G)alpha(G) <= Delta(G)mu(G) for every graph G with minimum degree delta(G), maximum degree Delta(G), independence number alpha(G), and matching number mu(G). Answering some problems they posed, we characterize the extremal graphs for delta(G) < Delta(G) as well as for delta(G) = Delta(G) = 3. (C) 2020 Elsevier B.V. All rights reserved.

引用

页数：4