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 条

[1] On a tree graph defined by a set of cycles
Li, XL
Neumann-Lara, V
Rivera-Campo, E
DISCRETE MATHEMATICS, 2003, 271 (1-3) : 303 - 310
[2] New Results on the Tree Graph Defined by a Set of Cycles
Hu, Yumei
2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 5597 - 5600
[3] A Necessary and Sufficient Condition on the Tree Graph Defined by a Set of Cycles
Hu, Yumei
2010 6TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS NETWORKING AND MOBILE COMPUTING (WICOM), 2010,
[4] On the spectrum of the perfect matching derangement graph
Renteln, Paul
JOURNAL OF ALGEBRAIC COMBINATORICS, 2022, 56 (01) : 215 - 228
[5] On the spectrum of the perfect matching derangement graph
Paul Renteln
Journal of Algebraic Combinatorics, 2022, 56 : 215 - 228
[6] Planar Graph Perfect Matching is in NC
Anari, Nima
Vazirani, Vijay V.
2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, : 650 - 661
[7] COMPUTING A PERFECT MATCHING IN A LINE GRAPH
NAOR, J
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 319 : 139 - 148
[8] Planar Graph Perfect Matching Is in NC
Anari, Nima
Vazirani, Vijay V.
JOURNAL OF THE ACM, 2020, 67 (04)
[9] Graph isomorphism algorithm by perfect matching
Fukuda, K
Nakamori, M
SYSTEM MODELING AND OPTIMIZATION XX, 2003, 130 : 229 - 238
[10] Boolean matching algorithm based on the perfect matching of the bipartite graph
Lu, ZW
Lin, ZH
Lei, Z
2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, 2001, : 150 - 154

← 1 2 3 4 5 →