Results 21 to 30 of about 982,672 (306)
Exact Matching and the Top-k Perfect Matching Problem [PDF]
, 2022 The aim of this note is to provide a reduction of the Exact Matching problem to the Top-$k$ Perfect Matching Problem. Together with earlier work by El Maalouly, this shows that the two problems are polynomial-time equivalent. The Exact Matching Problem
Maalouly, Nicolas El, Wulf, Lasse
core
Characterization of perfect matching transitive graphs
Electronic Journal of Graph Theory and Applications, 2018 A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M and N of G, there is an automorphism f : V(G) ↦ V(G) such that fe(M) = N, where fe(uv) = f(u)f(v). In this paper, the author proposed the definition of PM-
Ju Zhou
doaj +1 more source
Multi-path Summation for Decoding 2D Topological Codes [PDF]
Quantum, 2018 Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance.
Ben Criger, Imran Ashraf
doaj +1 more source
Extending a perfect matching to a Hamiltonian cycle [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Adel Alahmadi +5 more
doaj +1 more source
On the extremal connective eccentricity index among trees with maximum degree [PDF]
Transactions on Combinatorics, 2021 The connective eccentricity index (CEI) of a graph $G$ is defined as $\xi^{ce}(G)=\sum_{v \in V(G)}\frac{d_G(v)}{\varepsilon_G(v)}$, where $d_G(v)$ is the degree of $v$ and $\varepsilon_G(v)$ is the eccentricity of $v$. In this paper, we characterize the
Fazal Hayat
doaj +1 more source
Perfect Matchings and Perfect Powers [PDF]
Journal of Algebraic Combinatorics, 2003 In the last decade there have been many results about special families of graphs whose number of perfect matchings is given by perfect or near perfect powers. In this paper we present an approach that allows proving them in a unified way. We use this approach to prove a conjecture of James Propp stating that the number of tilings of the so-called Aztec
openaire +3 more sources
The Perfect Matching Cut Problem Revisited [PDF]
, 2021 In a graph, a perfect matching cut is an edge cut that is a perfect matching. perfect matching cut (pmc) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP -complete.
Van Bang Le +3 more
core +1 more source
Tight upper bound on the maximum anti-forcing numbers of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of $G$ is no more than the cyclomatic number.
Lingjuan Shi, Heping Zhang
doaj +1 more source
Graphs where each spanning tree has a perfect matching [PDF]
, 2021 An edge subset $S$ of a connected graph $G$ is called an anti-Kekul\\u27{e} set if $G-S$ is connected and has no perfect matching. We can see that a connected graph $G$ has no anti-Kekul\\u27{e} set if and only if each spanning tree of $G$ has a perfect ...
Zhang, Heping, Wu, Baoyindureng
core +1 more source
Binding Number, Toughness and General Matching Extendability in Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A connected graph $G$ with at least $2m + 2n + 2$ vertices which contains a perfect matching is $E(m, n)$-{\it extendable}, if for any two sets of disjoint independent edges $M$ and $N$ with $|M| = m$ and $|N|= n$, there is a perfect matching $F$ in $G ...
Hongliang Lu, Qinglin Yu
doaj +1 more source