On the perfect matching graph defined by a set of cycles

被引：1

作者：

Figueroa A.P. ^{[1
]}

Fresán-Figueroa J. ^{[2
]}

Rivera-Campo E. ^{[3
]}

机构：

[1] Instituto Tecnológico Autónomo de México, Calle Río Hondo 1, Alvaro Obregón, Progreso Tizapán, Mexico City, 01080, D.F.

[2] Universidad Autónoma Metropolitana - Cuajimalpa, Av. Vasco de Quiroga 4871, Cuajimalpa de Morelos, Santa Fe Cuajimalpa, Mexico City, 05348, D.F.

[3] Universidad Autónoma Metropolitana - Iztapalapa, Av. San Rafael Atlixco 186, Col. Vicentina, Iztapalapa, Mexico City, 09340, D.F.

来源：

Boletín de la Sociedad Matemática Mexicana | 2017年 / 23卷 / 2期

关键词：

Perfect matching; Perfect matching graph; Resonant cycle;

D O I：

10.1007/s40590-015-0079-1

中图分类号：

学科分类号：

摘要：

The perfect matching graph of a graph G, denoted by M(G), has one vertex for each perfect matching of G and two matchings are adjacent if their symmetric difference is a cycle of G. Let C be a family of cycles of G. The perfect matching graph defined byC is the spanning subgraph M(G, C) of M(G) in which two perfect matchings L and N are adjacent only if LΔN lies in C. We give a necessary condition and a sufficient condition for M(G, C) to be connected. We also give examples of graphs and of families of cycles for which the sufficient condition is satisfied. © 2015, Sociedad Matemática Mexicana.

引用

页码：549 / 556

页数：7

共 50 条

[31] A SIMPLE AS CORRECT ALGORITHM FOR DECIDING IF A GRAPH HAS A PERFECT MATCHING
BRITO, MR
DISCRETE APPLIED MATHEMATICS, 1995, 63 (02) : 181 - 185
[32] CYCLES THROUGH A SET OF SPECIFIED VERTICES OF A PLANAR GRAPH
Mohr, S.
ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 963 - 966
[33] A distributive lattice on the set of perfect matchings of a plane bipartite graph
Lam, PCB
Zhang, HP
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2003, 20 (01): : 13 - 29
[34] Euler cycles in K2m plus perfect matching
Dvorák, T
Havel, I
Liebl, P
EUROPEAN JOURNAL OF COMBINATORICS, 1999, 20 (03) : 227 - 232
[35] A Distributive Lattice on the Set of Perfect Matchings of a Plane Bipartite Graph
Peter Che Bor Lam
Heping Zhang
Order, 2003, 20 : 13 - 29
[36] Subgraph Matching with Set Similarity in a Large Graph Database
Hong, Liang
Zou, Lei
Lian, Xiang
Yu, Philip S.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (09) : 2507 - 2521
[37] EXTENDING SQL WITH GRAPH MATCHING, SET COVERING AND PARTITIONING
HORNG, JT
LIU, BJ
JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 1994, 17 (01) : 13 - 30
[38] Flexible Graph Matching and Graph Edit Distance Using Answer Set Programming
Chan, Sheung Chi
Cheney, James
PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES (PADL 2020), 2020, 12007 : 20 - 36
[39] PERFECT MATCHING INDEX VERSUS CIRCULAR FLOW NUMBER OF A CUBIC GRAPH
Macajova, Edita
Skoviera, Martin
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (02) : 1287 - 1297
[40] Exact weight perfect matching of bipartite graph is NP-complete
Zhu, Guohun
Luo, Xiangyu
Miao, Yuqing
WORLD CONGRESS ON ENGINEERING 2008, VOLS I-II, 2008, : 878 - 880

← 1 2 3 4 5 →