Results 11 to 20 of about 2,022 (201)
Perfect Matching Preservers [PDF]
The Electronic Journal of Combinatorics, 2006 For two bipartite graphs $G$ and $G'$, a bijection $\psi: E(G) \rightarrow E(G')$ is called a (perfect) matching preserver provided that $M$ is a perfect matching in $G$ if and only if $\psi(M)$ is a perfect matching in $G'$. We characterize bipartite graphs $G$ and $G'$ which are related by a matching preserver and the matching preservers between them.
Richard A. Brualdi +2 more
openaire +2 more sources
On two consequences of Berge–Fulkerson conjecture
AKCE International Journal of Graphs and Combinatorics, 2020 The classical Berge–Fulkerson conjecture states that any bridgeless cubic graph admits a list of six perfect matchings such that each edge of belongs to two of the perfect matchings from the list.
Vahan V. Mkrtchyan, Gagik N. Vardanyan
doaj +1 more source
On perfect matchings in matching covered graphs [PDF]
Journal of Graph Theory, 2018 AbstractA graph is matching‐covered if every edge of is contained in a perfect matching. A matching‐covered graph is strongly coverable if, for any edge of , the subgraph is still matching‐covered. An edge subset of a matching‐covered graph is feasible if there exist two perfect matchings and such that , and an edge subset with at least two ...
Jinghua He +3 more
openaire +2 more sources
SciPost Physics Core, 2023 We study perfect matchings, or close-packed dimer coverings, of finite sections of the eleven Archimedean lattices and give a constructive proof showing that any two perfect matchings can be transformed into each other using small sets of local ring ...
Henrik Schou Røising, Zhao Zhang
doaj +1 more source
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles [PDF]
, 2022 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching ...
Ito, Takehiro +4 more
core +1 more source
Fractional matching preclusion for generalized augmented cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Tianlong Ma +3 more
doaj +1 more source
Quasi-Tree Graphs With Extremal General Multiplicative Zagreb Indices
IEEE Access, 2020 Zagreb indices and their modified versions of a molecular graph are important molecular descriptors which can be applied in characterizing the structural properties of organic compounds from different aspects. In this article, by exploring the structures
Jianwei Du, Xiaoling Sun
doaj +1 more source
Eigenvalues and perfect matchings [PDF]
Linear Algebra and its Applications, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brouwer, A.E., Haemers, W.H.
openaire +3 more sources
Perfect Matchings of Cellular Graphs [PDF]
, 1996 We introduce a family of graphs, called cellular, and consider the problem of enumerating their perfect matchings. We prove that the number of perfect matchings of a cellular graph equals a power of 2 times the number of perfect matchings of a certain ...
Ciucu, Mihai
core +1 more source
The Number of Perfect Matchings in Hexagons on the Torus by Pfaffians
Journal of Mathematics, 2022 Let G be a (molecular) graph. A perfect matching of G is defined as a set of edges which are independent and cover every vertex of G exactly once. In the article, we present the formula on the number of the perfect matchings of two types of hexagons on ...
Shouliu Wei, Fuliang Lu, Xiaoling Ke
doaj +1 more source