Graphs with each edge in at most one maximum matching

被引:0
|
作者
Niu, Mengyuan [1 ]
Zhang, Yipei [2 ]
Liu, Jinfeng [1 ]
Wang, Xiumei [1 ]
机构
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Peoples R China
[2] North China Univ Water Resources & Elect Power, Sch Math & Stat, Zhengzhou 450046, Peoples R China
基金
中国国家自然科学基金;
关键词
Perfect matching; Maximum matching; Bipartite graph; Factor -critical graph;
D O I
10.1016/j.dam.2024.01.038
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A matching in a graph is a set of pairwise nonadjacent edges. A maximum matching is a matching which covers as many vertices as possible. In this paper, using the Gallai- Edmonds Structure Theorem, we obtain a characterization of graphs each of whose edges belongs to at most one maximum matching. (c) 2024 Published by Elsevier B.V.
引用
收藏
页码:70 / 74
页数:5
相关论文
共 50 条
  • [21] Matching Transversal Edge Domination in Graphs
    Alwardi, Anwar
    APPLICATIONS AND APPLIED MATHEMATICS-AN INTERNATIONAL JOURNAL, 2016, 11 (02): : 919 - 929
  • [22] On graphs with the maximum edge metric dimension
    Zhu, Enqiang
    Taranenko, Andrej
    Shao, Zehui
    Xu, Jin
    DISCRETE APPLIED MATHEMATICS, 2019, 257 : 317 - 324
  • [23] Graphs with maximum edge-integrity
    Beineke, LW
    Goddard, W
    Lipman, MJ
    ARS COMBINATORIA, 1997, 46 : 119 - 127
  • [24] MAXIMUM EDGE-COLORINGS OF GRAPHS
    Jendrol, Stanislav
    Vrbjarova, Michaela
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (01) : 117 - 125
  • [25] The maximum atom-bond connectivity index for graphs with edge-connectivity one
    Cui, Qing
    Qian, Qiuping
    Zhong, Lingping
    DISCRETE APPLIED MATHEMATICS, 2017, 220 : 170 - 173
  • [26] An algorithm for constructing the maximum matching graphs on bigraphs
    Li, Jing
    Wang, Shi-Ying
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2010, 38 (01): : 161 - 166
  • [27] Maximum Matching in Regular and Almost Regular Graphs
    Yuster, Raphael
    ALGORITHMICA, 2013, 66 (01) : 87 - 92
  • [28] Characterizations of maximum matching graphs of certain types
    Liu, Y
    DISCRETE MATHEMATICS, 2005, 290 (2-3) : 283 - 289
  • [29] Multithreaded Algorithms for Maximum Matching in Bipartite Graphs
    Azad, Ariful
    Halappanavar, Mahantesh
    Rajamanickam, Sivasankaran
    Boman, Erik G.
    Khan, Arif
    Pothen, Alex
    2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2012, : 860 - 872
  • [30] A NEW APPROACH TO MAXIMUM MATCHING IN GENERAL GRAPHS
    BLUM, N
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 443 : 586 - 597