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 条

[41] Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching
Zhao, Jinxing
Yu, Xiaoxiang
DISCRETE APPLIED MATHEMATICS, 2025, 361 : 480 - 486
[42] An optimal distributed algorithm for finding a set of fundamental cycles in a graph
Chaudhuri, P
COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2002, 17 (01): : 41 - 47
[43] A connected graph with set of empty intersection of all Longest Cycles
Junejo, Abdul Hameed
Soomro, Inayatullah
Ahmed, Israr
Kalhoro, Abdul Naeem
Muhammad, Raza
Jokhio, Imdad
Chohan, Rozina
Jumani, A. D.
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2019, 19 (05): : 87 - 89
[44] Hamilton cycles in the path graph of a set of points in convex position
Rivera-Campo, E
Urrutia-Galicia, V
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 18 (02): : 65 - 72
[45] ALGORITHMS FOR FINDING A FUNDAMENTAL SET OF CYCLES FOR AN UNDIRECTED LINEAR GRAPH
GOTLIEB, CC
CORNEIL, DG
COMMUNICATIONS OF THE ACM, 1967, 10 (12) : 780 - &
[46] Hamilton cycles in the path graph of a set of points in convex position
Comput Geom Theory Appl, 2 (65-72):
[47] Study on generalisation of triple connected perfect dominating set in fuzzy graph
Gunasekar, T.
Elavarasan, K.
INTERNATIONAL JOURNAL OF ENGINEERING SYSTEMS MODELLING AND SIMULATION, 2023, 14 (03) : 163 - 167
[48] Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
Wang, Yingqian
Xu, Jinghan
EUROPEAN JOURNAL OF COMBINATORICS, 2015, 43 : 98 - 123
[49] CORE INDEX OF PERFECT MATCHING POLYTOPE FOR A 2-CONNECTED CUBIC GRAPH
Wang, Xiumei
Lin, Yixun
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (01) : 189 - 201
[50] NO GRAPH IS PERFECT
BEHZAD, M
CHARTRAN.G
AMERICAN MATHEMATICAL MONTHLY, 1967, 74 (08): : 962 - &

← 1 2 3 4 5 →