BOUNDING COCHORDAL COVER NUMBER OF GRAPHS VIA VERTEX STRETCHING

被引：0

作者：

Fander, M. R. ^{[1
]}

机构：

[1] Islamic Azad Univ, Sci & Res Branch, Tehran, Iran

来源：

BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY | 2016年 / 42卷 / 03期

关键词：

Castelnuovo-Mumford regularity; induced matching number; cochordal cover number; BIPARTITE GRAPHS; MATCHINGS;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper, it is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases at most two. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipartite or weakly chordal graph.

引用

页码：679 / 685

页数：7

共 50 条

[21] Minimum vertex cover in rectangle graphs
Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2011, 44 (6-7): : 356 - 364
[22] Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
Bermudo, Sergio
Dettlaff, Magda
Lemanska, Magdalena
DISCRETE APPLIED MATHEMATICS, 2021, 304 : 153 - 163
[23] Bounding the number of edges in permutation graphs
Keevash, P
Loh, PS
Sudakov, B
ELECTRONIC JOURNAL OF COMBINATORICS, 2006, 13 (01):
[24] Minimum Vertex Cover in Rectangle Graphs
Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
ALGORITHMS-ESA 2010, 2010, 6346 : 255 - +
[25] Fractional Vertex Cover Reliability of Graphs
Brown, David
Clawson, Caitlynn
Erey, Aysel
Garcia, Rudy
Green, Carter
Hein, Derek
Powell, Samuel
Journal of Combinatorial Mathematics and Combinatorial Computing, 2024, 122 : 157 - 172
[26] Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
Bermudo, Sergio
Dettlaff, Magda
Lemańska, Magdalena
Discrete Applied Mathematics, 2021, 304 : 153 - 163
[27] Bounding the total forcing number of graphs
Shengjin Ji
Mengya He
Guang Li
Yingui Pan
Wenqian Zhang
Journal of Combinatorial Optimization, 2023, 46
[28] Bounding the total forcing number of graphs
Ji, Shengjin
He, Mengya
Li, Guang
Pan, Yingui
Zhang, Wenqian
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 46 (04)
[29] BOUNDING THE NUMBER OF EDGES OF MATCHSTICK GRAPHS
Lavollee, Jeremy
Swanepoel, Konrad J.
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (01) : 777 - 785
[30] Bounding the number of arithmetical structures on graphs
Keyes, Christopher
Reiter, Tomer
DISCRETE MATHEMATICS, 2021, 344 (09)

← 1 2 3 4 5 →