Results 21 to 30 of about 2,022 (201)
Perfect matchings in inhomogeneous random bipartite graphs in random environment
Cubo, 2022 In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erd\H os-R\'enyi random bipartite graphs in a random environment.
Jairo Bochi +2 more
doaj +1 more source
Low Weight Perfect Matchings [PDF]
The Electronic Journal of Combinatorics, 2020 Answering a question posed by Caro, Hansberg, Lauri, and Zarb, we show that for every positive integer $n$ and every function $\sigma\colon E(K_{4n})\to\{-1,1\}$ with $\sigma\left(E(K_{4n})\right)=0$, there is a perfect matching $M$ in $K_{4n}$with $\sigma(M)=0$.
Stefan Ehard +2 more
openaire +3 more sources
Conditional Strong Matching Preclusion of the Alternating Group Graph
Theory and Applications of Graphs, 2019 The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Mohamad Adballah, Eddie Cheng
doaj +1 more source
Bipartite Graphs Associated with Pell, Mersenne and Perrin Numbers
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 In this paper, we consider the relationships between the numbers of perfect matchings (1-factors) of bipartite graphs and Pell, Mersenne and Perrin Numbers.
Öteleş Ahmet
doaj +1 more source
Planar cycle-extendable graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching.
Aditya Y Dalwadi +3 more
doaj +1 more source
Matchings of quadratic size extend to long cycles in hypercubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Ruskey and Savage in 1993 asked whether every matching in a hypercube can be extended to a Hamiltonian cycle. A positive answer is known for perfect matchings, but the general case has been resolved only for matchings of linear size.
Tomáš Dvořák
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
Existence of perfect matchings in a plane bipartite graph [PDF]
, 1996 summary:We give a necessary and sufficient condition for the existence of perfect matchings in a plane bipartite graph in terms of elementary edge-cut, which extends the result for the existence of perfect matchings in a hexagonal system given in the ...
Che, Zhongyuan, Kochol, Martin
core +1 more source
Neuroplasticity and MRI: A perfect match [PDF]
NeuroImage, 2016 Numerous studies have illustrated the benefits of physical workout and cognitive exercise on brain function and structure and, more importantly, on decelerating cognitive decline in old age and promoting functional rehabilitation following injury. Despite these behavioral observations, the exact mechanisms underlying these neuroplastic phenomena remain
Julie Hamaide +2 more
openaire +3 more sources
On the kth Eigenvalues of Trees with Perfect Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Graphs and ...
An Chang, Wai Chee Shiu
doaj +3 more sources