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 条

[21] Extremal Bicyclic Graph with Perfect Matching for Different Indices
Duan, Shan
Zhu, Zhongxun
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2013, 36 (03) : 733 - 745
[22] Alternating sign property of the perfect matching derangement graph
Koh, Zhi Kang Samuel
Ku, Cheng Yeaw
Wong, Kok Bin
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2023, 194
[23] Codes parameterized by the edges of a bipartite graph with a perfect matching
Sarabia, Manuel Gonzalez
Villarreal, Rafael H.
ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2023, 31 (02): : 85 - 100
[24] Perfect matching in bipartite hypergraphs subject to a demand graph
Aronshtam, Lior
Ilani, Hagai
Shufan, Elad
ANNALS OF OPERATIONS RESEARCH, 2023, 321 (1-2) : 39 - 48
[25] AN ALGORITHM FOR FINDING A FUNDAMENTAL SET OF CYCLES OF A GRAPH
PATON, K
COMMUNICATIONS OF THE ACM, 1969, 12 (09) : 514 - &
[26] Approximating the bottleneck plane perfect matching of a point set
Abu-Affash, A. Karim
Biniaz, Ahmad
Carmi, Paz
Maheshwari, Anil
Smid, Michiel
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 48 (09): : 718 - 731
[27] Strong and Weak Perfect Dominating Set in Fuzzy Graph
Sreejil, K.
Kirubaharan, D. R.
JOURNAL OF ALGEBRAIC STATISTICS, 2022, 13 (01) : 19 - 24
[28] Rainbow perfect matchings and Hamilton cycles in the random geometric graph
Bal, Deepak
Bennett, Patrick
Perez-Gimenez, Xavier
Pralat, Pawel
RANDOM STRUCTURES & ALGORITHMS, 2017, 51 (04) : 587 - 606
[29] Boolean mapping algorithm based on perfect matching of bipartite graph
Lu, Z.-W.
Lin, Z.-H.
Zhang, L.
Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2001, 13 (11): : 961 - 965
[30] The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching
Wang, Xinlei
Zhou, Qi
Wong, Dein
Zhang, Chi
Tian, Fenglei
LINEAR ALGEBRA AND ITS APPLICATIONS, 2021, 609 : 152 - 162

← 1 2 3 4 5 →