Results 11 to 20 of about 622 (259)
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
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
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 in Random Octagonal Chain Graphs
Journal of Mathematics, 2021 A perfect matching of a (molecule) graph G is a set of independent edges covering all vertices in G. In this paper, we establish a simple formula for the expected value of the number of perfect matchings in random octagonal chain graphs and present the ...
Shouliu Wei +4 more
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
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
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
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