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 条
  • [31] DETOUR MONOPHONIC VERTEX COVER PEBBLING NUMBER (DMV CPN) OF SOME STANDARD GRAPHS
    Rani, K. Christy
    Dhivviyanandam, I.
    arXiv,
  • [32] Reducing the domination number of graphs via edge contractions and vertex deletions
    Galby, Esther
    Lima, Paloma T.
    Ries, Bernard
    DISCRETE MATHEMATICS, 2021, 344 (01)
  • [33] On the secure vertex cover pebbling number
    Hurlbert, Glenn H.
    Mathew, Lian
    Quadras, Jasintha
    Surya, S. Sarah
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2023, 16 (10)
  • [34] Vertex Cover Hop Dominating Sets in Graphs
    Bilar, Vergel T.
    Bonsocan, Maria Andrea O.
    Hassan, Javier A.
    Dagondon, Susan C.
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2024, 17 (01): : 93 - 104
  • [35] Vertex Cover Zero Forcing Sets in Graphs
    Hassan, Javier A.
    Laja, Ladznar S.
    INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2024, 19 (04): : 999 - 1003
  • [36] On the minimum vertex cover of generalized Petersen graphs
    Jin, Dannielle D. D.
    Wang, David G. L.
    DISCRETE APPLIED MATHEMATICS, 2019, 266 : 309 - 318
  • [37] Bounding the Number of Eulerian Tours in Undirected Graphs
    Punzi, Giulia
    COMPUTING AND COMBINATORICS, COCOON 2022, 2022, 13595 : 368 - 380
  • [38] Vertex Cover in Graphs with Locally Few Colors
    Kuhn, Fabian
    Mastrolilli, Monaldo
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I, 2011, 6755 : 498 - 509
  • [39] Dominance complexes and vertex cover numbers of graphs
    Matsushita T.
    Journal of Applied and Computational Topology, 2023, 7 (2) : 363 - 368
  • [40] Vertex cover in graphs with locally few colors
    Kuhn, Fabian
    Mastrolilli, Monaldo
    INFORMATION AND COMPUTATION, 2013, 222 : 265 - 277
12345