Results 11 to 20 of about 553 (214)
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
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
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
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
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
Near-Perfect Matchings on Cylinders Cm × Pn of Odd Order
EPJ Web of Conferences, 2018 A close relationship was established between the number of perfect and nearperfect matchings on cylinders Cm×Pn. Generating functions are obtained for the number of near-perfect matchings in these graphs for fixed odd m ≤ 13. A conjecture is put forth on
Perepechko Sergey N.
doaj +1 more source
Even cycles and perfect matchings in claw-free plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Lov{\'a}sz showed that a matching covered graph $G$ has an ear decomposition starting with an arbitrary edge of $G$. Let $G$ be a graph which has a perfect matching.
Shanshan Zhang +2 more
doaj +1 more source
Fractional matching preclusion for butterfly derived networks
Theory and Applications of Graphs, 2019 The 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.
Xia Wang +4 more
doaj +1 more source